Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …0101011001111100000100 |
3 | 1022210111200102121102212110 |
4 | 2103013223011121330010 |
5 | 2311120241020011322 |
6 | 33300245412021020 |
7 | 2062265164014054 |
oct | 223075305317404 |
9 | 38714612542773 |
10 | 10110002110212 |
11 | 324869a695604 |
12 | 1173477301770 |
13 | 5844a4c13a74 |
14 | 26d480701564 |
15 | 127eb7305c0c |
hex | 931eb159f04 |
10110002110212 has 48 divisors (see below), whose sum is σ = 24228028843200. Its totient is φ = 3278857859712.
The previous prime is 10110002110207. The next prime is 10110002110223. The reversal of 10110002110212 is 21201120001101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27388618 + ... + 27755294.
It is an arithmetic number, because the mean of its divisors is an integer number (504750600900).
Almost surely, 210110002110212 is an apocalyptic number.
10110002110212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110002110212 is an abundant number, since it is smaller than the sum of its proper divisors (14118026732988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110002110212 is a wasteful number, since it uses less digits than its factorization.
10110002110212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428820 (or 428818 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10110002110212 its reverse (21201120001101), we get a palindrome (31311122111313).
Subtracting 10110002110212 from its reverse (21201120001101), we obtain a square (11091117890889 = 33303332).
The spelling of 10110002110212 in words is "ten trillion, one hundred ten billion, two million, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •