Base | Representation |
---|---|
bin | 111011101000010… |
… | …011011101100101 |
3 | 2120201110122220211 |
4 | 323220103131211 |
5 | 4022101434341 |
6 | 243134255421 |
7 | 33535303642 |
oct | 7350233545 |
9 | 2521418824 |
10 | 1000421221 |
11 | 4737912a8 |
12 | 23b057571 |
13 | 12c356b27 |
14 | 96c1adc9 |
15 | 5cc66181 |
hex | 3ba13765 |
1000421221 has 2 divisors, whose sum is σ = 1000421222. Its totient is φ = 1000421220.
The previous prime is 1000421203. The next prime is 1000421239. The reversal of 1000421221 is 1221240001.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1000421203) and next prime (1000421239).
It can be written as a sum of positive squares in only one way, i.e., 885717121 + 114704100 = 29761^2 + 10710^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000421221 - 229 = 463550309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000421921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500210610 + 500210611.
It is an arithmetic number, because the mean of its divisors is an integer number (500210611).
Almost surely, 21000421221 is an apocalyptic number.
It is an amenable number.
1000421221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000421221 is an equidigital number, since it uses as much as digits as its factorization.
1000421221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 1000421221 is about 31629.4359892806. The cubic root of 1000421221 is about 1000.1403872905.
Adding to 1000421221 its reverse (1221240001), we get a palindrome (2221661222).
The spelling of 1000421221 in words is "one billion, four hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •