Base | Representation |
---|---|
bin | 10010101000010111… |
… | …101011100111011010 |
3 | 1220122011021111002000 |
4 | 102220113223213122 |
5 | 311432142240214 |
6 | 13105013021430 |
7 | 1305506500050 |
oct | 225027534732 |
9 | 56564244060 |
10 | 20004649434 |
11 | 8536115230 |
12 | 3a63624876 |
13 | 1b6a644c93 |
14 | d7ab761d0 |
15 | 7c1388809 |
hex | 4a85eb9da |
20004649434 has 256 divisors, whose sum is σ = 58599936000. Its totient is φ = 4900746240.
The previous prime is 20004649421. The next prime is 20004649447. The reversal of 20004649434 is 43494640002.
20004649434 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 4 + 649 + 4 + 3 + 4 = 666.
It is an interprime number because it is at equal distance from previous prime (20004649421) and next prime (20004649447).
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 127 ways as a sum of consecutive naturals, for example, 24727222 + ... + 24728030.
It is an arithmetic number, because the mean of its divisors is an integer number (228906000).
Almost surely, 220004649434 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20004649434, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29299968000).
20004649434 is an abundant number, since it is smaller than the sum of its proper divisors (38595286566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20004649434 is a wasteful number, since it uses less digits than its factorization.
20004649434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1170 (or 1164 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 36.
The spelling of 20004649434 in words is "twenty billion, four million, six hundred forty-nine thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •