Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …1011100101101111001100 |
3 | 1022210111201010102222201210 |
4 | 2103013223223211233030 |
5 | 2311120301100320022 |
6 | 33300250410334420 |
7 | 2062265345054130 |
oct | 223075353455714 |
9 | 38714633388653 |
10 | 10110012120012 |
11 | 32486a5302072 |
12 | 117347a72a410 |
13 | 5844a7009c1c |
14 | 26d481b893c0 |
15 | 127eb8131a0c |
hex | 931ebae5bcc |
10110012120012 has 24 divisors (see below), whose sum is σ = 26960032320256. Its totient is φ = 2888574891408.
The previous prime is 10110012120011. The next prime is 10110012120017. The reversal of 10110012120012 is 21002121001101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 10110012120012.
It is not an unprimeable number, because it can be changed into a prime (10110012120011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60178643488 + ... + 60178643655.
Almost surely, 210110012120012 is an apocalyptic number.
10110012120012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110012120012 is an abundant number, since it is smaller than the sum of its proper divisors (16850020200244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110012120012 is a wasteful number, since it uses less digits than its factorization.
10110012120012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120357287157 (or 120357287155 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10110012120012 its reverse (21002121001101), we get a palindrome (31112133121113).
The spelling of 10110012120012 in words is "ten trillion, one hundred ten billion, twelve million, one hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •