Base | Representation |
---|---|
bin | 11101011101011000111… |
… | …10100111000011110101 |
3 | 10120202200201121111212211 |
4 | 32232230132213003311 |
5 | 113041002010120041 |
6 | 2053000415013421 |
7 | 133062350465335 |
oct | 16565436470365 |
9 | 3522621544784 |
10 | 1012211020021 |
11 | 360304806a83 |
12 | 14420b50a271 |
13 | 745b3075586 |
14 | 36dc40b50c5 |
15 | 1b4e37bb481 |
hex | ebac7a70f5 |
1012211020021 has 2 divisors, whose sum is σ = 1012211020022. Its totient is φ = 1012211020020.
The previous prime is 1012211020001. The next prime is 1012211020031. The reversal of 1012211020021 is 1200201122101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 711483815025 + 300727204996 = 843495^2 + 548386^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012211020021 - 223 = 1012202631413 is a prime.
It is a super-2 number, since 2×10122110200212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012211019983 and 1012211020010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012211020001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506105510010 + 506105510011.
It is an arithmetic number, because the mean of its divisors is an integer number (506105510011).
Almost surely, 21012211020021 is an apocalyptic number.
It is an amenable number.
1012211020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012211020021 is an equidigital number, since it uses as much as digits as its factorization.
1012211020021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1012211020021 its reverse (1200201122101), we get a palindrome (2212412142122).
The spelling of 1012211020021 in words is "one trillion, twelve billion, two hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •