Base | Representation |
---|---|
bin | 1011000000011000001011… |
… | …1101110000111000001101 |
3 | 1120211212002212101111222202 |
4 | 2300012002331300320031 |
5 | 3041231043221230101 |
6 | 41423102224451245 |
7 | 2356164015466145 |
oct | 260060275607015 |
9 | 46755085344882 |
10 | 12101120101901 |
11 | 3946068905056 |
12 | 1435340779b25 |
13 | 69a19129a8cc |
14 | 2db9a96d1925 |
15 | 15eba066236b |
hex | b0182f70e0d |
12101120101901 has 2 divisors, whose sum is σ = 12101120101902. Its totient is φ = 12101120101900.
The previous prime is 12101120101897. The next prime is 12101120101907. The reversal of 12101120101901 is 10910102110121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9273845999401 + 2827274102500 = 3045299^2 + 1681450^2 .
It is an emirp because it is prime and its reverse (10910102110121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12101120101901 - 22 = 12101120101897 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12101120101907) 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 as a sum of consecutive naturals, namely, 6050560050950 + 6050560050951.
It is an arithmetic number, because the mean of its divisors is an integer number (6050560050951).
Almost surely, 212101120101901 is an apocalyptic number.
It is an amenable number.
12101120101901 is a deficient number, since it is larger than the sum of its proper divisors (1).
12101120101901 is an equidigital number, since it uses as much as digits as its factorization.
12101120101901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 12101120101901 in words is "twelve trillion, one hundred one billion, one hundred twenty million, one hundred one thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •