Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …111100111010001011101000 |
3 | 111020121121112210111101021020 |
4 | 112331300213330322023220 |
5 | 101214300244012223422 |
6 | 554451135144412440 |
7 | 30163042640056323 |
oct | 2675604774721350 |
9 | 436547483441236 |
10 | 101001121211112 |
11 | 2a200375914621 |
12 | b3b283b177120 |
13 | 44484987aabc5 |
14 | 1ad26a21197ba |
15 | ba240e6ab95c |
hex | 5bdc27f3a2e8 |
101001121211112 has 16 divisors (see below), whose sum is σ = 252502803027840. Its totient is φ = 33667040403696.
The previous prime is 101001121211069. The next prime is 101001121211173. The reversal of 101001121211112 is 211112121100101.
It is a junction number, because it is equal to n+sod(n) for n = 101001121211091 and 101001121211100.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2104190025208 + ... + 2104190025255.
It is an arithmetic number, because the mean of its divisors is an integer number (15781425189240).
Almost surely, 2101001121211112 is an apocalyptic number.
101001121211112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101001121211112 is an abundant number, since it is smaller than the sum of its proper divisors (151501681816728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001121211112 is a wasteful number, since it uses less digits than its factorization.
101001121211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4208380050472 (or 4208380050468 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101001121211112 its reverse (211112121100101), we get a palindrome (312113242311213).
The spelling of 101001121211112 in words is "one hundred one trillion, one billion, one hundred twenty-one million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •