Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …1011110010101010010010 |
3 | 1022210121022120121000200010 |
4 | 2103020213323302222102 |
5 | 2311124333342001320 |
6 | 33300535001135350 |
7 | 2062332401311536 |
oct | 223104773625222 |
9 | 38717276530603 |
10 | 10111023000210 |
11 | 3249073987350 |
12 | 117370118a556 |
13 | 5846085864a2 |
14 | 26d53a129bc6 |
15 | 128026c61ae0 |
hex | 93227ef2a92 |
10111023000210 has 64 divisors (see below), whose sum is σ = 26921183016960. Its totient is φ = 2409612050880.
The previous prime is 10111023000191. The next prime is 10111023000223. The reversal of 10111023000210 is 1200032011101.
10111023000210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101110230002102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 259637002 + ... + 259675941.
It is an arithmetic number, because the mean of its divisors is an integer number (420643484640).
Almost surely, 210111023000210 is an apocalyptic number.
10111023000210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111023000210 is an abundant number, since it is smaller than the sum of its proper divisors (16810160016750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111023000210 is a wasteful number, since it uses less digits than its factorization.
10111023000210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 519313023.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10111023000210 its reverse (1200032011101), we get a palindrome (11311055011311).
The spelling of 10111023000210 in words is "ten trillion, one hundred eleven billion, twenty-three million, two hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •