Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …011001110001011001111010 |
3 | 111020121121112011011102011110 |
4 | 112331300213121301121322 |
5 | 101214300234133000442 |
6 | 554451134215141150 |
7 | 30163042465554165 |
oct | 2675604731613172 |
9 | 436547464142143 |
10 | 101001112000122 |
11 | 2a2003706a3234 |
12 | b3b28380747b6 |
13 | 4448496904509 |
14 | 1ad26a0bdcadc |
15 | ba240d98c69c |
hex | 5bdc2767167a |
101001112000122 has 32 divisors (see below), whose sum is σ = 204770365054272. Its totient is φ = 33205684938624.
The previous prime is 101001112000081. The next prime is 101001112000123. The reversal of 101001112000122 is 221000211100101.
It is a super-2 number, since 2×1010011120001222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101001112000098 and 101001112000107.
It is not an unprimeable number, because it can be changed into a prime (101001112000123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120398613 + ... + 121234599.
It is an arithmetic number, because the mean of its divisors is an integer number (6399073907946).
Almost surely, 2101001112000122 is an apocalyptic number.
101001112000122 is an abundant number, since it is smaller than the sum of its proper divisors (103769253054150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001112000122 is a wasteful number, since it uses less digits than its factorization.
101001112000122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111902.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101001112000122 its reverse (221000211100101), we get a palindrome (322001323100223).
The spelling of 101001112000122 in words is "one hundred one trillion, one billion, one hundred twelve million, one hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •