Base | Representation |
---|---|
bin | 11110000000011010010… |
… | …11101111000010111011 |
3 | 10122120020002110212211210 |
4 | 33000031023233002323 |
5 | 113343003403044011 |
6 | 2105350241454203 |
7 | 134326320501030 |
oct | 17001513570273 |
9 | 3576202425753 |
10 | 1031013331131 |
11 | 368283168673 |
12 | 147998341363 |
13 | 762bb587954 |
14 | 37c892ad387 |
15 | 1bc443066a6 |
hex | f00d2ef0bb |
1031013331131 has 16 divisors (see below), whose sum is σ = 1571442042368. Its totient is φ = 589010184000.
The previous prime is 1031013331121. The next prime is 1031013331147. The reversal of 1031013331131 is 1311333101301.
It is not a de Polignac number, because 1031013331131 - 213 = 1031013322939 is a prime.
It is a super-2 number, since 2×10310133311312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031013331098 and 1031013331107.
It is not an unprimeable number, because it can be changed into a prime (1031013331121) 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, 5755135 + ... + 5931576.
It is an arithmetic number, because the mean of its divisors is an integer number (98215127648).
Almost surely, 21031013331131 is an apocalyptic number.
1031013331131 is a deficient number, since it is larger than the sum of its proper divisors (540428711237).
1031013331131 is a wasteful number, since it uses less digits than its factorization.
1031013331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11690922.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 1031013331131 its reverse (1311333101301), we get a palindrome (2342346432432).
The spelling of 1031013331131 in words is "one trillion, thirty-one billion, thirteen million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •