Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …11110101000100001111010 |
3 | 2121211000001002201000011000 |
4 | 10203002221132220201322 |
5 | 10110140413021010020 |
6 | 110311545314545430 |
7 | 4132652606310645 |
oct | 443025136504172 |
9 | 77730032630130 |
10 | 20000211110010 |
11 | 641105084911a |
12 | 22b0212298276 |
13 | b2101cc5abc1 |
14 | 4d20302d2a5c |
15 | 24a3b8687090 |
hex | 1230a97a887a |
20000211110010 has 128 divisors (see below), whose sum is σ = 53398165662720. Its totient is φ = 5326965734400.
The previous prime is 20000211110003. The next prime is 20000211110021. The reversal of 20000211110010 is 1001111200002.
It is a happy number.
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 = 20000211109974 and 20000211110001.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1268960530 + ... + 1268976290.
It is an arithmetic number, because the mean of its divisors is an integer number (417173169240).
Almost surely, 220000211110010 is an apocalyptic number.
20000211110010 is an abundant number, since it is smaller than the sum of its proper divisors (33397954552710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000211110010 is a wasteful number, since it uses less digits than its factorization.
20000211110010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21141 (or 21135 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20000211110010 its reverse (1001111200002), we get a palindrome (21001322310012).
The spelling of 20000211110010 in words is "twenty trillion, two hundred eleven million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •