Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0100000011110111011100 |
3 | 1022210121020222022121002000 |
4 | 2103020212210003313130 |
5 | 2311124312000031022 |
6 | 33300532420202300 |
7 | 2062332001654440 |
oct | 223104644036734 |
9 | 38717228277060 |
10 | 10111000002012 |
11 | 32490619a9478 |
12 | 11736b5539390 |
13 | 5846038934a0 |
14 | 26d537060820 |
15 | 128024c1c6ac |
hex | 93226903ddc |
10111000002012 has 192 divisors, whose sum is σ = 32548536975360. Its totient is φ = 2643038512128.
The previous prime is 10111000002001. The next prime is 10111000002029. The reversal of 10111000002012 is 21020000011101.
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 = 10111000001985 and 10111000002003.
It is a congruent number.
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, 3441628 + ... + 5662755.
It is an arithmetic number, because the mean of its divisors is an integer number (169523630080).
Almost surely, 210111000002012 is an apocalyptic number.
10111000002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10111000002012 is an abundant number, since it is smaller than the sum of its proper divisors (22437536973348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111000002012 is a wasteful number, since it uses less digits than its factorization.
10111000002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9104529 (or 9104521 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10111000002012 its reverse (21020000011101), we get a palindrome (31131000013113).
The spelling of 10111000002012 in words is "ten trillion, one hundred eleven billion, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •