Base | Representation |
---|---|
bin | 1011000000011000100011… |
… | …1011010001001010011001 |
3 | 1120211212100211120111200111 |
4 | 2300012020323101022121 |
5 | 3041231244322023001 |
6 | 41423120200204321 |
7 | 2356166341526650 |
oct | 260061073211231 |
9 | 46755324514614 |
10 | 12101220111001 |
11 | 394610a3023aa |
12 | 143536a1696a1 |
13 | 69a1a8c155a8 |
14 | 2db9b8ac6197 |
15 | 15eba9319851 |
hex | b0188ed1299 |
12101220111001 has 8 divisors (see below), whose sum is σ = 13829988781440. Its totient is φ = 10372457175648.
The previous prime is 12101220110911. The next prime is 12101220111007. The reversal of 12101220111001 is 10011102210121.
It is a happy number.
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 12101220111001 - 221 = 12101218013849 is a prime.
It is a super-2 number, since 2×121012201110012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12101220111007) 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, 5031060 + ... + 7036618.
It is an arithmetic number, because the mean of its divisors is an integer number (1728748597680).
Almost surely, 212101220111001 is an apocalyptic number.
It is an amenable number.
12101220111001 is a deficient number, since it is larger than the sum of its proper divisors (1728768670439).
12101220111001 is an equidigital number, since it uses as much as digits as its factorization.
12101220111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2867543.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12101220111001 its reverse (10011102210121), we get a palindrome (22112322321122).
The spelling of 12101220111001 in words is "twelve trillion, one hundred one billion, two hundred twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •