Base | Representation |
---|---|
bin | 1001011111001100000000… |
… | …0010001110010110011111 |
3 | 1100221020021100221222202201 |
4 | 2113303000002032112133 |
5 | 2331402003003400411 |
6 | 34104041535432331 |
7 | 2124433606306315 |
oct | 227630002162637 |
9 | 40836240858681 |
10 | 10431402403231 |
11 | 3361a2978a787 |
12 | 12058136856a7 |
13 | 5a88a556c244 |
14 | 280c4dab60b5 |
15 | 1315286323c1 |
hex | 97cc008e59f |
10431402403231 has 2 divisors, whose sum is σ = 10431402403232. Its totient is φ = 10431402403230.
The previous prime is 10431402403199. The next prime is 10431402403237. The reversal of 10431402403231 is 13230420413401.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10431402403231 - 25 = 10431402403199 is a prime.
It is a super-2 number, since 2×104314024032312 (a number of 27 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 10431402403231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10431402403237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5215701201615 + 5215701201616.
It is an arithmetic number, because the mean of its divisors is an integer number (5215701201616).
Almost surely, 210431402403231 is an apocalyptic number.
10431402403231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10431402403231 is an equidigital number, since it uses as much as digits as its factorization.
10431402403231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 10431402403231 its reverse (13230420413401), we get a palindrome (23661822816632).
The spelling of 10431402403231 in words is "ten trillion, four hundred thirty-one billion, four hundred two million, four hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •