Base | Representation |
---|---|
bin | 1001001100101011000001… |
… | …1000111001110101001011 |
3 | 1022210211020010101012001022 |
4 | 2103022300120321311023 |
5 | 2311144030424130011 |
6 | 33301554101343055 |
7 | 2062443210314540 |
oct | 223126030716513 |
9 | 38724203335038 |
10 | 10113312333131 |
11 | 324a039182027 |
12 | 117403ba07a8b |
13 | 5848b1965257 |
14 | 26d6b61bcbc7 |
15 | 12810cc278db |
hex | 932b0639d4b |
10113312333131 has 16 divisors (see below), whose sum is σ = 11963030058240. Its totient is φ = 8365154545440.
The previous prime is 10113312333127. The next prime is 10113312333161. The reversal of 10113312333131 is 13133321331101.
It is not a de Polignac number, because 10113312333131 - 22 = 10113312333127 is a prime.
It is a super-2 number, since 2×101133123331312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10113312333131.
It is not an unprimeable number, because it can be changed into a prime (10113312333161) 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, 12963065 + ... + 13721066.
It is an arithmetic number, because the mean of its divisors is an integer number (747689378640).
Almost surely, 210113312333131 is an apocalyptic number.
10113312333131 is a deficient number, since it is larger than the sum of its proper divisors (1849717725109).
10113312333131 is a wasteful number, since it uses less digits than its factorization.
10113312333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26686034.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 10113312333131 its reverse (13133321331101), we get a palindrome (23246633664232).
The spelling of 10113312333131 in words is "ten trillion, one hundred thirteen billion, three hundred twelve million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •