Base | Representation |
---|---|
bin | 11011101111100000100011… |
… | …000111100001110110101001 |
3 | 121000000020100110121022002020 |
4 | 123233200203013201312221 |
5 | 111443021104122333001 |
6 | 1111255314230455053 |
7 | 34462035413060613 |
oct | 3357404307416651 |
9 | 530006313538066 |
10 | 122012020121001 |
11 | 3597100956989a |
12 | 118268b6804489 |
13 | 53108b804c07a |
14 | 221b5b0097db3 |
15 | e18c2ca2a736 |
hex | 6ef8231e1da9 |
122012020121001 has 8 divisors (see below), whose sum is σ = 162692055519264. Its totient is φ = 81336665735040.
The previous prime is 122012020120999. The next prime is 122012020121003. The reversal of 122012020121001 is 100121020210221.
It is an interprime number because it is at equal distance from previous prime (122012020120999) and next prime (122012020121003).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122012020121001 - 21 = 122012020120999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122012020121003) 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, 1170192255 + ... + 1170296516.
It is an arithmetic number, because the mean of its divisors is an integer number (20336506939908).
Almost surely, 2122012020121001 is an apocalyptic number.
It is an amenable number.
122012020121001 is a deficient number, since it is larger than the sum of its proper divisors (40680035398263).
122012020121001 is a wasteful number, since it uses less digits than its factorization.
122012020121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2340506151.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122012020121001 its reverse (100121020210221), we get a palindrome (222133040331222).
The spelling of 122012020121001 in words is "one hundred twenty-two trillion, twelve billion, twenty million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •