Base | Representation |
---|---|
bin | 100100000101100… |
… | …1110011110010101 |
3 | 10010101112012211211 |
4 | 1020023032132111 |
5 | 4434442334141 |
6 | 320053501421 |
7 | 42002333521 |
oct | 11013163625 |
9 | 3111465754 |
10 | 1210902421 |
11 | 571582a03 |
12 | 299641871 |
13 | 163b40a11 |
14 | b6b6ad81 |
15 | 71490d81 |
hex | 482ce795 |
1210902421 has 2 divisors, whose sum is σ = 1210902422. Its totient is φ = 1210902420.
The previous prime is 1210902409. The next prime is 1210902431. The reversal of 1210902421 is 1242090121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1174432900 + 36469521 = 34270^2 + 6039^2 .
It is a cyclic number.
It is not a de Polignac number, because 1210902421 - 223 = 1202513813 is a prime.
It is a super-2 number, since 2×12109024212 = 2932569346367322482, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210902392 and 1210902401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210902431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605451210 + 605451211.
It is an arithmetic number, because the mean of its divisors is an integer number (605451211).
Almost surely, 21210902421 is an apocalyptic number.
It is an amenable number.
1210902421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210902421 is an equidigital number, since it uses as much as digits as its factorization.
1210902421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 1210902421 is about 34798.0232340862. The cubic root of 1210902421 is about 1065.8670805339.
Adding to 1210902421 its reverse (1242090121), we get a palindrome (2452992542).
The spelling of 1210902421 in words is "one billion, two hundred ten million, nine hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •