Base | Representation |
---|---|
bin | 11011100000111101011001… |
… | …010100100000010000000001 |
3 | 120212110122122102121222022121 |
4 | 123200331121110200100001 |
5 | 111330130442220041001 |
6 | 1105212123241004241 |
7 | 34326562115161564 |
oct | 3340753124402001 |
9 | 525418572558277 |
10 | 121012202112001 |
11 | 35615a94346492 |
12 | 116a4b85783681 |
13 | 526a52b6a3715 |
14 | 21c5043ca64db |
15 | decc122626a1 |
hex | 6e0f59520401 |
121012202112001 has 4 divisors (see below), whose sum is σ = 121211563236352. Its totient is φ = 120812840987652.
The previous prime is 121012202111963. The next prime is 121012202112013. The reversal of 121012202112001 is 100211202210121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121012202112001 - 27 = 121012202111873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121012202112031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99680561265 + ... + 99680562478.
It is an arithmetic number, because the mean of its divisors is an integer number (30302890809088).
Almost surely, 2121012202112001 is an apocalyptic number.
It is an amenable number.
121012202112001 is a deficient number, since it is larger than the sum of its proper divisors (199361124351).
121012202112001 is an equidigital number, since it uses as much as digits as its factorization.
121012202112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199361124350.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121012202112001 its reverse (100211202210121), we get a palindrome (221223404322122).
The spelling of 121012202112001 in words is "one hundred twenty-one trillion, twelve billion, two hundred two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •