Base | Representation |
---|---|
bin | 111111111000000… |
… | …0110000100110100 |
3 | 12112101000122101110 |
4 | 1333300012010310 |
5 | 13342142023403 |
6 | 552402355020 |
7 | 104053604346 |
oct | 17760060464 |
9 | 5471018343 |
10 | 2143314228 |
11 | 9aa932780 |
12 | 4b995ba70 |
13 | 282075093 |
14 | 164923296 |
15 | c8271103 |
hex | 7fc06134 |
2143314228 has 96 divisors (see below), whose sum is σ = 5799306240. Its totient is φ = 609258240.
The previous prime is 2143314227. The next prime is 2143314241. The reversal of 2143314228 is 8224133412.
It is a junction number, because it is equal to n+sod(n) for n = 2143314195 and 2143314204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2143314227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 254176 + ... + 262472.
It is an arithmetic number, because the mean of its divisors is an integer number (60409440).
Almost surely, 22143314228 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2143314228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2899653120).
2143314228 is an abundant number, since it is smaller than the sum of its proper divisors (3655992012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2143314228 is a wasteful number, since it uses less digits than its factorization.
2143314228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8437 (or 8435 counting only the distinct ones).
The product of its digits is 9216, while the sum is 30.
The square root of 2143314228 is about 46295.9418091910. The cubic root of 2143314228 is about 1289.3236500171.
The spelling of 2143314228 in words is "two billion, one hundred forty-three million, three hundred fourteen thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •