Base | Representation |
---|---|
bin | 1100001111011110100… |
… | …0100101111001001011 |
3 | 202002212002002120121122 |
4 | 3003313220211321023 |
5 | 11421210114343111 |
6 | 240341054225455 |
7 | 21123516242213 |
oct | 3036750457113 |
9 | 662762076548 |
10 | 210313043531 |
11 | 81214259478 |
12 | 349154b528b |
13 | 16aa8b233b6 |
14 | a271a51243 |
15 | 570da6acdb |
hex | 30f7a25e4b |
210313043531 has 2 divisors, whose sum is σ = 210313043532. Its totient is φ = 210313043530.
The previous prime is 210313043513. The next prime is 210313043539. The reversal of 210313043531 is 135340313012.
Together with previous prime (210313043513) 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 210313043531 - 210 = 210313042507 is a prime.
It is a super-2 number, since 2×2103130435312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210313043531.
It is not a weakly prime, because it can be changed into another prime (210313043539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105156521765 + 105156521766.
It is an arithmetic number, because the mean of its divisors is an integer number (105156521766).
Almost surely, 2210313043531 is an apocalyptic number.
210313043531 is a deficient number, since it is larger than the sum of its proper divisors (1).
210313043531 is an equidigital number, since it uses as much as digits as its factorization.
210313043531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 210313043531 its reverse (135340313012), we get a palindrome (345653356543).
The spelling of 210313043531 in words is "two hundred ten billion, three hundred thirteen million, forty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •