Base | Representation |
---|---|
bin | 1011000001100110000000… |
… | …1110000001111011100101 |
3 | 1120220212000212011220101102 |
4 | 2300121200032001323211 |
5 | 3042101340032444343 |
6 | 41440435254405445 |
7 | 2360533520626031 |
oct | 260314016017345 |
9 | 46825025156342 |
10 | 12122011999973 |
11 | 3953a09832317 |
12 | 14393b1360885 |
13 | 69c140693285 |
14 | 2dc9cc2251c1 |
15 | 1604c48593b8 |
hex | b0660381ee5 |
12122011999973 has 2 divisors, whose sum is σ = 12122011999974. Its totient is φ = 12122011999972.
The previous prime is 12122011999969. The next prime is 12122012000083. The reversal of 12122011999973 is 37999911022121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11998416160129 + 123595839844 = 3463873^2 + 351562^2 .
It is a cyclic number.
It is not a de Polignac number, because 12122011999973 - 22 = 12122011999969 is a prime.
It is a super-2 number, since 2×121220119999732 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12122011990973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061005999986 + 6061005999987.
It is an arithmetic number, because the mean of its divisors is an integer number (6061005999987).
Almost surely, 212122011999973 is an apocalyptic number.
It is an amenable number.
12122011999973 is a deficient number, since it is larger than the sum of its proper divisors (1).
12122011999973 is an equidigital number, since it uses as much as digits as its factorization.
12122011999973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1102248, while the sum is 56.
The spelling of 12122011999973 in words is "twelve trillion, one hundred twenty-two billion, eleven million, nine hundred ninety-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •