Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …010110010101101011011010 |
3 | 111020121121112002110200121010 |
4 | 112331300213112111223122 |
5 | 101214300233420200442 |
6 | 554451134143554350 |
7 | 30163042455115242 |
oct | 2675604726255332 |
9 | 436547462420533 |
10 | 101001111100122 |
11 | 2a200370139032 |
12 | b3b28378bb9b6 |
13 | 444849667a97c |
14 | 1ad26a0a46b22 |
15 | ba240d860b9c |
hex | 5bdc27595ada |
101001111100122 has 64 divisors (see below), whose sum is σ = 212916831696000. Its totient is φ = 31852678733568.
The previous prime is 101001111100063. The next prime is 101001111100151. The reversal of 101001111100122 is 221001111100101.
It is a super-2 number, since 2×1010011111001222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101001111100098 and 101001111100107.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 261041904 + ... + 261428532.
It is an arithmetic number, because the mean of its divisors is an integer number (3326825495250).
Almost surely, 2101001111100122 is an apocalyptic number.
101001111100122 is an abundant number, since it is smaller than the sum of its proper divisors (111915720595878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001111100122 is a wasteful number, since it uses less digits than its factorization.
101001111100122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389695.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101001111100122 its reverse (221001111100101), we get a palindrome (322002222200223).
The spelling of 101001111100122 in words is "one hundred one trillion, one billion, one hundred eleven million, one hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •