Base | Representation |
---|---|
bin | 1001010011100011000011… |
… | …0011111111011000100011 |
3 | 1100020010010000112220212002 |
4 | 2110320300303333120203 |
5 | 2320112432321100103 |
6 | 33432130551154215 |
7 | 2104124253600155 |
oct | 224706063773043 |
9 | 40203100486762 |
10 | 10231431034403 |
11 | 32951420a4607 |
12 | 1192b0567596b |
13 | 592a87165cb7 |
14 | 2752bd728ad5 |
15 | 12b222966488 |
hex | 94e30cff623 |
10231431034403 has 4 divisors (see below), whose sum is σ = 10231480861728. Its totient is φ = 10231381207080.
The previous prime is 10231431034333. The next prime is 10231431034439. The reversal of 10231431034403 is 30443013413201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10231431034403 - 212 = 10231431030307 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10231431034453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24604376 + ... + 25016757.
It is an arithmetic number, because the mean of its divisors is an integer number (2557870215432).
Almost surely, 210231431034403 is an apocalyptic number.
10231431034403 is a deficient number, since it is larger than the sum of its proper divisors (49827325).
10231431034403 is an equidigital number, since it uses as much as digits as its factorization.
10231431034403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49827324.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 10231431034403 its reverse (30443013413201), we get a palindrome (40674444447604).
The spelling of 10231431034403 in words is "ten trillion, two hundred thirty-one billion, four hundred thirty-one million, thirty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •