Base | Representation |
---|---|
bin | 1011000000011000100001… |
… | …1001010110100001000001 |
3 | 1120211212100012211210120101 |
4 | 2300012020121112201001 |
5 | 3041231240033020113 |
6 | 41423115241442401 |
7 | 2356166203126525 |
oct | 260061031264101 |
9 | 46755305753511 |
10 | 12101211220033 |
11 | 394610528a4a1 |
12 | 14353671a0401 |
13 | 69a1a7121770 |
14 | 2db9b784dd85 |
15 | 15eba86602dd |
hex | b0188656841 |
12101211220033 has 8 divisors (see below), whose sum is σ = 13032460218176. Its totient is φ = 11170017450000.
The previous prime is 12101211220001. The next prime is 12101211220039. The reversal of 12101211220033 is 33002211210121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12101211220033 - 25 = 12101211220001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12101211220039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13351383 + ... + 14228908.
It is an arithmetic number, because the mean of its divisors is an integer number (1629057527272).
Almost surely, 212101211220033 is an apocalyptic number.
12101211220033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12101211220033 is a deficient number, since it is larger than the sum of its proper divisors (931248998143).
12101211220033 is a wasteful number, since it uses less digits than its factorization.
12101211220033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27614055.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12101211220033 its reverse (33002211210121), we get a palindrome (45103422430154).
The spelling of 12101211220033 in words is "twelve trillion, one hundred one billion, two hundred eleven million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •