Base | Representation |
---|---|
bin | 10010101000001001… |
… | …111101010101101010 |
3 | 1220121220111201100002 |
4 | 102220021331111222 |
5 | 311430232131020 |
6 | 13104403543002 |
7 | 1305434064662 |
oct | 225011752552 |
9 | 56556451302 |
10 | 20001052010 |
11 | 8534088455 |
12 | 3a6238aa62 |
13 | 1b69985724 |
14 | d7a4bb1a2 |
15 | 7c0dc7975 |
hex | 4a827d56a |
20001052010 has 32 divisors (see below), whose sum is σ = 36350899200. Its totient is φ = 7922940480.
The previous prime is 20001051971. The next prime is 20001052129. The reversal of 20001052010 is 1025010002.
It is a junction number, because it is equal to n+sod(n) for n = 20001051982 and 20001052000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2973431 + ... + 2980149.
It is an arithmetic number, because the mean of its divisors is an integer number (1135965600).
Almost surely, 220001052010 is an apocalyptic number.
20001052010 is a deficient number, since it is larger than the sum of its proper divisors (16349847190).
20001052010 is a wasteful number, since it uses less digits than its factorization.
20001052010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9566.
The product of its (nonzero) digits is 20, while the sum is 11.
Adding to 20001052010 its reverse (1025010002), we get a palindrome (21026062012).
The spelling of 20001052010 in words is "twenty billion, one million, fifty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •