Base | Representation |
---|---|
bin | 111011111010101… |
… | …101000000000101 |
3 | 2121001112201002212 |
4 | 323322231000011 |
5 | 4024320310141 |
6 | 243425513205 |
7 | 33624302516 |
oct | 7372550005 |
9 | 2531481085 |
10 | 1005244421 |
11 | 476486015 |
12 | 2407a2805 |
13 | 1303552ac |
14 | 97714a0d |
15 | 5d3ba2eb |
hex | 3bead005 |
1005244421 has 2 divisors, whose sum is σ = 1005244422. Its totient is φ = 1005244420.
The previous prime is 1005244403. The next prime is 1005244423. The reversal of 1005244421 is 1244425001.
1005244421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 979377025 + 25867396 = 31295^2 + 5086^2 .
It is a cyclic number.
It is not a de Polignac number, because 1005244421 - 210 = 1005243397 is a prime.
Together with 1005244423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1005244423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502622210 + 502622211.
It is an arithmetic number, because the mean of its divisors is an integer number (502622211).
Almost surely, 21005244421 is an apocalyptic number.
It is an amenable number.
1005244421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1005244421 is an equidigital number, since it uses as much as digits as its factorization.
1005244421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1280, while the sum is 23.
The square root of 1005244421 is about 31705.5897437660. The cubic root of 1005244421 is about 1001.7450932115.
Adding to 1005244421 its reverse (1244425001), we get a palindrome (2249669422).
The spelling of 1005244421 in words is "one billion, five million, two hundred forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •