Base | Representation |
---|---|
bin | 1001001101101110000111… |
… | …1011010101000011111011 |
3 | 1022212112201100012121221221 |
4 | 2103123201323111003323 |
5 | 2311442422231412311 |
6 | 33314133215212511 |
7 | 2063651431146256 |
oct | 223334173250373 |
9 | 38775640177857 |
10 | 10131323310331 |
11 | 3256740981853 |
12 | 1177627817137 |
13 | 5864c223a102 |
14 | 27050426609d |
15 | 12881404d671 |
hex | 936e1ed50fb |
10131323310331 has 16 divisors (see below), whose sum is σ = 10721929881600. Its totient is φ = 9546469120800.
The previous prime is 10131323310289. The next prime is 10131323310347. The reversal of 10131323310331 is 13301332313101.
It is not a de Polignac number, because 10131323310331 - 27 = 10131323310203 is a prime.
It is a super-2 number, since 2×101313233103312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131323310296 and 10131323310305.
It is not an unprimeable number, because it can be changed into a prime (10131323310131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25455936 + ... + 25850866.
It is an arithmetic number, because the mean of its divisors is an integer number (670120617600).
Almost surely, 210131323310331 is an apocalyptic number.
10131323310331 is a deficient number, since it is larger than the sum of its proper divisors (590606571269).
10131323310331 is a wasteful number, since it uses less digits than its factorization.
10131323310331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402210.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 10131323310331 its reverse (13301332313101), we get a palindrome (23432655623432).
The spelling of 10131323310331 in words is "ten trillion, one hundred thirty-one billion, three hundred twenty-three million, three hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •