Base | Representation |
---|---|
bin | 11011101111100000101001… |
… | …000100100111010000100001 |
3 | 121000000020121102120200202012 |
4 | 123233200221010213100201 |
5 | 111443021310211120001 |
6 | 1111255332200002305 |
7 | 34462041035152421 |
oct | 3357405104472041 |
9 | 530006542520665 |
10 | 122012120020001 |
11 | 3597105a9a1452 |
12 | 11826924160395 |
13 | 53109029588c3 |
14 | 221b5bd460481 |
15 | e18c366b02bb |
hex | 6ef829127421 |
122012120020001 has 4 divisors (see below), whose sum is σ = 122693751975600. Its totient is φ = 121330488064404.
The previous prime is 122012120019989. The next prime is 122012120020027. The reversal of 122012120020001 is 100020021210221.
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 122012120020001 - 214 = 122012120003617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122012120320001) 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, 340815977531 + ... + 340815977888.
It is an arithmetic number, because the mean of its divisors is an integer number (30673437993900).
Almost surely, 2122012120020001 is an apocalyptic number.
It is an amenable number.
122012120020001 is a deficient number, since it is larger than the sum of its proper divisors (681631955599).
122012120020001 is an equidigital number, since it uses as much as digits as its factorization.
122012120020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681631955598.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122012120020001 its reverse (100020021210221), we get a palindrome (222032141230222).
The spelling of 122012120020001 in words is "one hundred twenty-two trillion, twelve billion, one hundred twenty million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •