Base | Representation |
---|---|
bin | 1011000111010011011101… |
… | …1100001110011001100101 |
3 | 1121021020020121211110222001 |
4 | 2301310313130032121211 |
5 | 3100203242144244023 |
6 | 41553501512205301 |
7 | 2400605525014243 |
oct | 261646734163145 |
9 | 47236217743861 |
10 | 12220112103013 |
11 | 399157a782741 |
12 | 145440a999831 |
13 | 6a84756a7019 |
14 | 303656c07793 |
15 | 162d16da66ad |
hex | b1d3770e665 |
12220112103013 has 2 divisors, whose sum is σ = 12220112103014. Its totient is φ = 12220112103012.
The previous prime is 12220112102921. The next prime is 12220112103061. The reversal of 12220112103013 is 31030121102221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11170147099329 + 1049965003684 = 3342177^2 + 1024678^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220112103013 - 225 = 12220078548581 is a prime.
It is a super-2 number, since 2×122201121030132 (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 (12220112103113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110056051506 + 6110056051507.
It is an arithmetic number, because the mean of its divisors is an integer number (6110056051507).
Almost surely, 212220112103013 is an apocalyptic number.
It is an amenable number.
12220112103013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220112103013 is an equidigital number, since it uses as much as digits as its factorization.
12220112103013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12220112103013 its reverse (31030121102221), we get a palindrome (43250233205234).
The spelling of 12220112103013 in words is "twelve trillion, two hundred twenty billion, one hundred twelve million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •