Base | Representation |
---|---|
bin | 11101111110111010101… |
… | …00011101010010100011 |
3 | 10122111011010110020202201 |
4 | 32333131110131102203 |
5 | 113334332314430311 |
6 | 2105134434154031 |
7 | 134300400106315 |
oct | 16773524352243 |
9 | 3574133406681 |
10 | 1030210311331 |
11 | 367a00954a43 |
12 | 1477b3422917 |
13 | 761c10b83c6 |
14 | 37c107997b5 |
15 | 1bbe8a849c1 |
hex | efdd51d4a3 |
1030210311331 has 2 divisors, whose sum is σ = 1030210311332. Its totient is φ = 1030210311330.
The previous prime is 1030210311313. The next prime is 1030210311343. The reversal of 1030210311331 is 1331130120301.
Together with previous prime (1030210311313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1030210311331 - 29 = 1030210310819 is a prime.
It is a super-2 number, since 2×10302103113312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030210311299 and 1030210311308.
It is not a weakly prime, because it can be changed into another prime (1030210311311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515105155665 + 515105155666.
It is an arithmetic number, because the mean of its divisors is an integer number (515105155666).
Almost surely, 21030210311331 is an apocalyptic number.
1030210311331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030210311331 is an equidigital number, since it uses as much as digits as its factorization.
1030210311331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1030210311331 its reverse (1331130120301), we get a palindrome (2361340431632).
The spelling of 1030210311331 in words is "one trillion, thirty billion, two hundred ten million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •