Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0011111000100110010000 |
3 | 1022210111200222122100221200 |
4 | 2103013223203320212100 |
5 | 2311120300041200422 |
6 | 33300250255151200 |
7 | 2062265321642166 |
oct | 223075343704620 |
9 | 38714628570850 |
10 | 10110010100112 |
11 | 32486a415252a |
12 | 1173479b15500 |
13 | 5844a6780710 |
14 | 26d4817c1236 |
15 | 127eb7d832ac |
hex | 931eb8f8990 |
10110010100112 has 120 divisors (see below), whose sum is σ = 30925230283584. Its totient is φ = 3064342862592.
The previous prime is 10110010100093. The next prime is 10110010100119. The reversal of 10110010100112 is 21100101001101.
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 = 10110010100094 and 10110010100103.
It is not an unprimeable number, because it can be changed into a prime (10110010100119) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40177908 + ... + 40428755.
Almost surely, 210110010100112 is an apocalyptic number.
10110010100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110010100112 is an abundant number, since it is smaller than the sum of its proper divisors (20815220183472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110010100112 is a wasteful number, since it uses less digits than its factorization.
10110010100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80606757 (or 80606748 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10110010100112 its reverse (21100101001101), we get a palindrome (31210111101213).
The spelling of 10110010100112 in words is "ten trillion, one hundred ten billion, ten million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •