Base | Representation |
---|---|
bin | 11011101111011000001010… |
… | …001000100011001000101001 |
3 | 120222222101002121101201111202 |
4 | 123233120022020203020221 |
5 | 111442344131310222101 |
6 | 1111251224242333545 |
7 | 34461266230026134 |
oct | 3357301210431051 |
9 | 528871077351452 |
10 | 122003011023401 |
11 | 35968206124492 |
12 | 1182500165a2b5 |
13 | 530cab0734ba1 |
14 | 221ad9779521b |
15 | e188a1b5336b |
hex | 6ef60a223229 |
122003011023401 has 2 divisors, whose sum is σ = 122003011023402. Its totient is φ = 122003011023400.
The previous prime is 122003011023349. The next prime is 122003011023497. The reversal of 122003011023401 is 104320110300221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89948152810000 + 32054858213401 = 9484100^2 + 5661701^2 .
It is a cyclic number.
It is not a de Polignac number, because 122003011023401 - 26 = 122003011023337 is a prime.
It is a super-2 number, since 2×1220030110234012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122003019023401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61001505511700 + 61001505511701.
It is an arithmetic number, because the mean of its divisors is an integer number (61001505511701).
Almost surely, 2122003011023401 is an apocalyptic number.
It is an amenable number.
122003011023401 is a deficient number, since it is larger than the sum of its proper divisors (1).
122003011023401 is an equidigital number, since it uses as much as digits as its factorization.
122003011023401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 122003011023401 its reverse (104320110300221), we get a palindrome (226323121323622).
The spelling of 122003011023401 in words is "one hundred twenty-two trillion, three billion, eleven million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •