Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …100101110001001111001010 |
3 | 112102110222210220010100212001 |
4 | 121000232122211301033022 |
5 | 103404224022224310442 |
6 | 1025541432350541214 |
7 | 32112211231125445 |
oct | 3100563245611712 |
9 | 472428726110761 |
10 | 110001001010122 |
11 | 32060187393992 |
12 | 10406b2080780a |
13 | 494c0857a3341 |
14 | 1d24110c7265c |
15 | cab5a25432b7 |
hex | 640b9a9713ca |
110001001010122 has 32 divisors (see below), whose sum is σ = 167776851913344. Its totient is φ = 54079758532800.
The previous prime is 110001001010119. The next prime is 110001001010123. The reversal of 110001001010122 is 221010100100011.
110001001010122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1100010010101222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110001001010099 and 110001001010108.
It is not an unprimeable number, because it can be changed into a prime (110001001010123) 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, 78229153 + ... + 79622875.
It is an arithmetic number, because the mean of its divisors is an integer number (5243026622292).
Almost surely, 2110001001010122 is an apocalyptic number.
110001001010122 is a deficient number, since it is larger than the sum of its proper divisors (57775850903222).
110001001010122 is a wasteful number, since it uses less digits than its factorization.
110001001010122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1395294.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110001001010122 its reverse (221010100100011), we get a palindrome (331011101110133).
The spelling of 110001001010122 in words is "one hundred ten trillion, one billion, one million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •