Base | Representation |
---|---|
bin | 1001011000001000111101… |
… | …0100110100111110000011 |
3 | 1100111122202100120010102221 |
4 | 2112002033110310332003 |
5 | 2322411021441042011 |
6 | 33532255354351511 |
7 | 2112616330645063 |
oct | 226021724647603 |
9 | 40448670503387 |
10 | 10310326112131 |
11 | 3315648334191 |
12 | 11a626342b597 |
13 | 59a34b3b5846 |
14 | 2790458433a3 |
15 | 12d2dde2a971 |
hex | 9608f534f83 |
10310326112131 has 16 divisors (see below), whose sum is σ = 10336922023680. Its totient is φ = 10283776174080.
The previous prime is 10310326112129. The next prime is 10310326112159. The reversal of 10310326112131 is 13121162301301.
It is a cyclic number.
It is not a de Polignac number, because 10310326112131 - 21 = 10310326112129 is a prime.
It is a super-2 number, since 2×103103261121312 (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 = 10310326112096 and 10310326112105.
It is not an unprimeable number, because it can be changed into a prime (10310326112161) 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, 3368285341 + ... + 3368288401.
It is an arithmetic number, because the mean of its divisors is an integer number (646057626480).
Almost surely, 210310326112131 is an apocalyptic number.
10310326112131 is a deficient number, since it is larger than the sum of its proper divisors (26595911549).
10310326112131 is a wasteful number, since it uses less digits than its factorization.
10310326112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8094.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 10310326112131 its reverse (13121162301301), we get a palindrome (23431488413432).
The spelling of 10310326112131 in words is "ten trillion, three hundred ten billion, three hundred twenty-six million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •