Base | Representation |
---|---|
bin | 1001011000001000001110… |
… | …1100111111111101101111 |
3 | 1100111122020202122121022101 |
4 | 2112002003230333331233 |
5 | 2322410122031401111 |
6 | 33532224151155531 |
7 | 2112611442364606 |
oct | 226020354777557 |
9 | 40448222577271 |
10 | 10310131122031 |
11 | 3315558263244 |
12 | 11a620a075ba7 |
13 | 59a319b939a0 |
14 | 2790279a6a3d |
15 | 12d2cbc60bc1 |
hex | 96083b3ff6f |
10310131122031 has 4 divisors (see below), whose sum is σ = 11103218131432. Its totient is φ = 9517044112632.
The previous prime is 10310131122007. The next prime is 10310131122037. The reversal of 10310131122031 is 13022113101301.
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 10310131122031 - 221 = 10310129024879 is a prime.
It is a super-2 number, since 2×103101311220312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310131122037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 396543504681 + ... + 396543504706.
It is an arithmetic number, because the mean of its divisors is an integer number (2775804532858).
Almost surely, 210310131122031 is an apocalyptic number.
10310131122031 is a deficient number, since it is larger than the sum of its proper divisors (793087009401).
10310131122031 is an equidigital number, since it uses as much as digits as its factorization.
10310131122031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 793087009400.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10310131122031 its reverse (13022113101301), we get a palindrome (23332244223332).
The spelling of 10310131122031 in words is "ten trillion, three hundred ten billion, one hundred thirty-one million, one hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •