Base | Representation |
---|---|
bin | 1001000110011001011010… |
… | …01001111011100011011010 |
3 | 2121212000220201010010101200 |
4 | 10203030231021323203122 |
5 | 10110330022103210020 |
6 | 110320533045055030 |
7 | 4133514326200341 |
oct | 443145511734332 |
9 | 77760821103350 |
10 | 20011010210010 |
11 | 6415692639856 |
12 | 22b23269b7476 |
13 | b220513746c1 |
14 | 4d2776628b58 |
15 | 24a7eb790590 |
hex | 12332d27b8da |
20011010210010 has 48 divisors (see below), whose sum is σ = 52565004162216. Its totient is φ = 5281256300544.
The previous prime is 20011010210003. The next prime is 20011010210027. The reversal of 20011010210010 is 1001201011002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 9413661012561 + 10597349197449 = 3068169^2 + 3255357^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20011010209974 and 20011010210001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1146097239 + ... + 1146114698.
Almost surely, 220011010210010 is an apocalyptic number.
20011010210010 is an abundant number, since it is smaller than the sum of its proper divisors (32553993952206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20011010210010 is a wasteful number, since it uses less digits than its factorization.
20011010210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2292212047 (or 2292212044 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20011010210010 its reverse (1001201011002), we get a palindrome (21012211221012).
The spelling of 20011010210010 in words is "twenty trillion, eleven billion, ten million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •