Base | Representation |
---|---|
bin | 11101011101000010001… |
… | …10101100101011100101 |
3 | 10120202012102112222001121 |
4 | 32232201012230223211 |
5 | 113040104132432323 |
6 | 2052525441053541 |
7 | 133054542533236 |
oct | 16564106545345 |
9 | 3522172488047 |
10 | 1012020202213 |
11 | 360217025809 |
12 | 1441776272b1 |
13 | 74582684827 |
14 | 36da6a0308d |
15 | 1b4d1b77a5d |
hex | eba11acae5 |
1012020202213 has 2 divisors, whose sum is σ = 1012020202214. Its totient is φ = 1012020202212.
The previous prime is 1012020202189. The next prime is 1012020202229. The reversal of 1012020202213 is 3122020202101.
It is a happy number.
It is an a-pointer prime, because the next prime (1012020202229) can be obtained adding 1012020202213 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 773444614849 + 238575587364 = 879457^2 + 488442^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012020202213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012080202213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506010101106 + 506010101107.
It is an arithmetic number, because the mean of its divisors is an integer number (506010101107).
Almost surely, 21012020202213 is an apocalyptic number.
It is an amenable number.
1012020202213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012020202213 is an equidigital number, since it uses as much as digits as its factorization.
1012020202213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1012020202213 its reverse (3122020202101), we get a palindrome (4134040404314).
The spelling of 1012020202213 in words is "one trillion, twelve billion, twenty million, two hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •