Base | Representation |
---|---|
bin | 1011000111010111001010… |
… | …0001011000110010100101 |
3 | 1121021022210200222010010101 |
4 | 2301311302201120302211 |
5 | 3100212304421441122 |
6 | 41554144121224101 |
7 | 2400642222112414 |
oct | 261656241306245 |
9 | 47238720863111 |
10 | 12221103312037 |
11 | 3991a39241754 |
12 | 1454646932031 |
13 | 6a85a2b56a39 |
14 | 30370c70747b |
15 | 162d73ded027 |
hex | b1d72858ca5 |
12221103312037 has 2 divisors, whose sum is σ = 12221103312038. Its totient is φ = 12221103312036.
The previous prime is 12221103311983. The next prime is 12221103312043. The reversal of 12221103312037 is 73021330112221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11282618999521 + 938484312516 = 3358961^2 + 968754^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221103312037 - 227 = 12220969094309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12221103311996 and 12221103312014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12221103310037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110551656018 + 6110551656019.
It is an arithmetic number, because the mean of its divisors is an integer number (6110551656019).
Almost surely, 212221103312037 is an apocalyptic number.
It is an amenable number.
12221103312037 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221103312037 is an equidigital number, since it uses as much as digits as its factorization.
12221103312037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 12221103312037 its reverse (73021330112221), we get a palindrome (85242433424258).
The spelling of 12221103312037 in words is "twelve trillion, two hundred twenty-one billion, one hundred three million, three hundred twelve thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •