Base | Representation |
---|---|
bin | 11011101111100000100011… |
… | …000111011101000000000001 |
3 | 121000000020100110120021210221 |
4 | 123233200203013131000001 |
5 | 111443021104121213441 |
6 | 1111255314230223041 |
7 | 34462035412645633 |
oct | 3357404307350001 |
9 | 530006313507727 |
10 | 122012020101121 |
11 | 35971009555967 |
12 | 118268b67b4a81 |
13 | 53108b8042cc7 |
14 | 221b5b0090a53 |
15 | e18c2ca248d1 |
hex | 6ef8231dd001 |
122012020101121 has 2 divisors, whose sum is σ = 122012020101122. Its totient is φ = 122012020101120.
The previous prime is 122012020101109. The next prime is 122012020101149. The reversal of 122012020101121 is 121101020210221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107862536004721 + 14149484096400 = 10385689^2 + 3761580^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122012020101121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122012020101095 and 122012020101104.
It is not a weakly prime, because it can be changed into another prime (122012020101421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61006010050560 + 61006010050561.
It is an arithmetic number, because the mean of its divisors is an integer number (61006010050561).
Almost surely, 2122012020101121 is an apocalyptic number.
It is an amenable number.
122012020101121 is a deficient number, since it is larger than the sum of its proper divisors (1).
122012020101121 is an equidigital number, since it uses as much as digits as its factorization.
122012020101121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 122012020101121 its reverse (121101020210221), we get a palindrome (243113040311342).
The spelling of 122012020101121 in words is "one hundred twenty-two trillion, twelve billion, twenty million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •