Base | Representation |
---|---|
bin | 10001110010001010111… |
… | …101001010000110001101 |
3 | 11022211110101112001011112 |
4 | 101302022331022012031 |
5 | 130010331103000023 |
6 | 2333231555101405 |
7 | 154202553413606 |
oct | 21621275120615 |
9 | 4284411461145 |
10 | 1222102000013 |
11 | 43132179a904 |
12 | 178a275a1865 |
13 | 8b32260091b |
14 | 43215a5adad |
15 | 21bca266478 |
hex | 11c8af4a18d |
1222102000013 has 2 divisors, whose sum is σ = 1222102000014. Its totient is φ = 1222102000012.
The previous prime is 1222101999961. The next prime is 1222102000019. The reversal of 1222102000013 is 3100002012221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1125547002724 + 96554997289 = 1060918^2 + 310733^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222102000013 - 240 = 122590372237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222102000019) 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, 611051000006 + 611051000007.
It is an arithmetic number, because the mean of its divisors is an integer number (611051000007).
Almost surely, 21222102000013 is an apocalyptic number.
It is an amenable number.
1222102000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222102000013 is an equidigital number, since it uses as much as digits as its factorization.
1222102000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1222102000013 its reverse (3100002012221), we get a palindrome (4322104012234).
The spelling of 1222102000013 in words is "one trillion, two hundred twenty-two billion, one hundred two million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •