Base | Representation |
---|---|
bin | 101001001111001101010… |
… | …010000010000000000000 |
3 | 101000220121022101211220222 |
4 | 221033031102002000000 |
5 | 332412134320113003 |
6 | 10005501542122212 |
7 | 411510613230065 |
oct | 51171522020000 |
9 | 11026538354828 |
10 | 2833827504128 |
11 | 9a2901826065 |
12 | 39926b120368 |
13 | 1772c885017a |
14 | 9b22d710c6c |
15 | 4daaae48c38 |
hex | 293cd482000 |
2833827504128 has 112 divisors (see below), whose sum is σ = 5826208962240. Its totient is φ = 1377262043136.
The previous prime is 2833827504083. The next prime is 2833827504143. The reversal of 2833827504128 is 8214057283382.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 2833827504128.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 352505933 + ... + 352513971.
Almost surely, 22833827504128 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 2833827504128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2913104481120).
2833827504128 is an abundant number, since it is smaller than the sum of its proper divisors (2992381458112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2833827504128 is an equidigital number, since it uses as much as digits as its factorization.
2833827504128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9265 (or 9241 counting only the distinct ones).
The product of its (nonzero) digits is 5160960, while the sum is 53.
The spelling of 2833827504128 in words is "two trillion, eight hundred thirty-three billion, eight hundred twenty-seven million, five hundred four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •