Base | Representation |
---|---|
bin | 111100001101101… |
… | …011111111011101 |
3 | 2121101220112201101 |
4 | 330031223333131 |
5 | 4032104033041 |
6 | 244124313101 |
7 | 34014510535 |
oct | 7415537735 |
9 | 2541815641 |
10 | 1010221021 |
11 | 479275007 |
12 | 2423a2791 |
13 | 1313a8524 |
14 | 9824c4c5 |
15 | 5da4eb31 |
hex | 3c36bfdd |
1010221021 has 2 divisors, whose sum is σ = 1010221022. Its totient is φ = 1010221020.
The previous prime is 1010221001. The next prime is 1010221033. The reversal of 1010221021 is 1201220101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 899340121 + 110880900 = 29989^2 + 10530^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010221021 is a prime.
It is a super-2 number, since 2×10102210212 = 2041093022540564882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010220989 and 1010221007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010221001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505110510 + 505110511.
It is an arithmetic number, because the mean of its divisors is an integer number (505110511).
Almost surely, 21010221021 is an apocalyptic number.
It is an amenable number.
1010221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010221021 is an equidigital number, since it uses as much as digits as its factorization.
1010221021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1010221021 is about 31783.9742795013. The cubic root of 1010221021 is about 1003.3954647700.
Adding to 1010221021 its reverse (1201220101), we get a palindrome (2211441122).
The spelling of 1010221021 in words is "one billion, ten million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •