Base | Representation |
---|---|
bin | 1011000000011000001001… |
… | …0111100111100001010101 |
3 | 1120211212002011120110211210 |
4 | 2300012002113213201111 |
5 | 3041231033141231401 |
6 | 41423101230252033 |
7 | 2356163534500206 |
oct | 260060227474125 |
9 | 46755064513753 |
10 | 12101110102101 |
11 | 39460631a5059 |
12 | 1435339357019 |
13 | 69a18c1a9177 |
14 | 2db9a824b5ad |
15 | 15eb9e8394d6 |
hex | b01825e7855 |
12101110102101 has 16 divisors (see below), whose sum is σ = 16218272214144. Its totient is φ = 8025685222464.
The previous prime is 12101110102087. The next prime is 12101110102117. The reversal of 12101110102101 is 10120101110121.
It is not a de Polignac number, because 12101110102101 - 27 = 12101110101973 is a prime.
It is a super-2 number, since 2×121011101021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101110102141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5214736 + ... + 7169078.
It is an arithmetic number, because the mean of its divisors is an integer number (1013642013384).
Almost surely, 212101110102101 is an apocalyptic number.
It is an amenable number.
12101110102101 is a deficient number, since it is larger than the sum of its proper divisors (4117162112043).
12101110102101 is a wasteful number, since it uses less digits than its factorization.
12101110102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1965020.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 12101110102101 its reverse (10120101110121), we get a palindrome (22221211212222).
The spelling of 12101110102101 in words is "twelve trillion, one hundred one billion, one hundred ten million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •