Base | Representation |
---|---|
bin | 100100000100111… |
… | …0001001101101111 |
3 | 10010100210210212001 |
4 | 1020021301031233 |
5 | 4434343123211 |
6 | 320041353131 |
7 | 41666153041 |
oct | 11011611557 |
9 | 3110723761 |
10 | 1210520431 |
11 | 571341a0a |
12 | 2994987a7 |
13 | 163a38ba3 |
14 | b6aaba91 |
15 | 71417ac1 |
hex | 4827136f |
1210520431 has 2 divisors, whose sum is σ = 1210520432. Its totient is φ = 1210520430.
The previous prime is 1210520413. The next prime is 1210520459. The reversal of 1210520431 is 1340250121.
Together with previous prime (1210520413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1210520431 - 211 = 1210518383 is a prime.
It is a super-2 number, since 2×12105204312 = 2930719427736851522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210520399 and 1210520408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210520401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605260215 + 605260216.
It is an arithmetic number, because the mean of its divisors is an integer number (605260216).
Almost surely, 21210520431 is an apocalyptic number.
1210520431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210520431 is an equidigital number, since it uses as much as digits as its factorization.
1210520431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1210520431 is about 34792.5341273096. The cubic root of 1210520431 is about 1065.7549896448.
Adding to 1210520431 its reverse (1340250121), we get a palindrome (2550770552).
The spelling of 1210520431 in words is "one billion, two hundred ten million, five hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •