Base | Representation |
---|---|
bin | 11101100010001010111… |
… | …011000110001000101010 |
3 | 21012000122012101012220122 |
4 | 131202022323012020222 |
5 | 231223012124424041 |
6 | 4152210445523242 |
7 | 266426162334656 |
oct | 35421273061052 |
9 | 7160565335818 |
10 | 2029555311146 |
11 | 712803076570 |
12 | 289411b73522 |
13 | 11950376c06c |
14 | 70333c1da66 |
15 | 37bd7a66c4b |
hex | 1d88aec622a |
2029555311146 has 64 divisors (see below), whose sum is σ = 3644012012544. Its totient is φ = 836979916800.
The previous prime is 2029555311103. The next prime is 2029555311193. The reversal of 2029555311146 is 6411135559202.
It is a super-2 number, since 2×20295553111462 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2029555311097 and 2029555311106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2639090 + ... + 3320226.
It is an arithmetic number, because the mean of its divisors is an integer number (56937687696).
Almost surely, 22029555311146 is an apocalyptic number.
2029555311146 is a deficient number, since it is larger than the sum of its proper divisors (1614456701398).
2029555311146 is a wasteful number, since it uses less digits than its factorization.
2029555311146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681455.
The product of its (nonzero) digits is 324000, while the sum is 44.
The spelling of 2029555311146 in words is "two trillion, twenty-nine billion, five hundred fifty-five million, three hundred eleven thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •