Base | Representation |
---|---|
bin | 1001011000001011110110… |
… | …0101110111100011111011 |
3 | 1100111201202110011010201210 |
4 | 2112002331211313203323 |
5 | 2322414114144044011 |
6 | 33532504403414203 |
7 | 2112644504464200 |
oct | 226027545674373 |
9 | 40451673133653 |
10 | 10311102331131 |
11 | 3315a06501a98 |
12 | 11a643b384363 |
13 | 59a443160324 |
14 | 2790ba97bca7 |
15 | 12d3371566a6 |
hex | 960bd9778fb |
10311102331131 has 36 divisors (see below), whose sum is σ = 16988817214968. Its totient is φ = 5545466777088.
The previous prime is 10311102331109. The next prime is 10311102331139. The reversal of 10311102331131 is 13113320111301.
It is not a de Polignac number, because 10311102331131 - 26 = 10311102331067 is a prime.
It is a super-2 number, since 2×103111023311312 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 10311102331098 and 10311102331107.
It is not an unprimeable number, because it can be changed into a prime (10311102331139) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 121313146 + ... + 121398111.
Almost surely, 210311102331131 is an apocalyptic number.
10311102331131 is a deficient number, since it is larger than the sum of its proper divisors (6677714883837).
10311102331131 is a wasteful number, since it uses less digits than its factorization.
10311102331131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242711308 (or 242711284 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 10311102331131 its reverse (13113320111301), we get a palindrome (23424422442432).
The spelling of 10311102331131 in words is "ten trillion, three hundred eleven billion, one hundred two million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •