Base | Representation |
---|---|
bin | 111100001101101… |
… | …100001111000101 |
3 | 2121101220121002102 |
4 | 330031230033011 |
5 | 4032104101041 |
6 | 244124321445 |
7 | 34014513464 |
oct | 7415541705 |
9 | 2541817072 |
10 | 1010222021 |
11 | 479275836 |
12 | 2423a3285 |
13 | 1313a8b13 |
14 | 9824c9db |
15 | 5da5009b |
hex | 3c36c3c5 |
1010222021 has 2 divisors, whose sum is σ = 1010222022. Its totient is φ = 1010222020.
The previous prime is 1010222011. The next prime is 1010222033. The reversal of 1010222021 is 1202220101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 677560900 + 332661121 = 26030^2 + 18239^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010222021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010221993 and 1010222011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010222011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505111010 + 505111011.
It is an arithmetic number, because the mean of its divisors is an integer number (505111011).
Almost surely, 21010222021 is an apocalyptic number.
It is an amenable number.
1010222021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010222021 is an equidigital number, since it uses as much as digits as its factorization.
1010222021 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 11.
The square root of 1010222021 is about 31783.9900106956. The cubic root of 1010222021 is about 1003.3957958511.
Adding to 1010222021 its reverse (1202220101), we get a palindrome (2212442122).
It can be divided in two parts, 10102 and 22021, that added together give a palindrome (32123).
The spelling of 1010222021 in words is "one billion, ten million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •