Base | Representation |
---|---|
bin | 111000111001111000… |
… | …0010010110001010001 |
3 | 102200102101222021212122 |
4 | 1301303300102301101 |
5 | 4000231441431141 |
6 | 132045522104025 |
7 | 11554154262212 |
oct | 1616360226121 |
9 | 380371867778 |
10 | 122201123921 |
11 | 479093920a8 |
12 | 1b824aab015 |
13 | b6a6220466 |
14 | 5cb37d7409 |
15 | 32a334564b |
hex | 1c73c12c51 |
122201123921 has 2 divisors, whose sum is σ = 122201123922. Its totient is φ = 122201123920.
The previous prime is 122201123903. The next prime is 122201124011. The reversal of 122201123921 is 129321102221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103612528321 + 18588595600 = 321889^2 + 136340^2 .
It is an emirp because it is prime and its reverse (129321102221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122201123921 is a prime.
It is a super-2 number, since 2×1222011239212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122201123221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61100561960 + 61100561961.
It is an arithmetic number, because the mean of its divisors is an integer number (61100561961).
Almost surely, 2122201123921 is an apocalyptic number.
It is an amenable number.
122201123921 is a deficient number, since it is larger than the sum of its proper divisors (1).
122201123921 is an equidigital number, since it uses as much as digits as its factorization.
122201123921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 122201123921 in words is "one hundred twenty-two billion, two hundred one million, one hundred twenty-three thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •