Base | Representation |
---|---|
bin | 1110001001011100110011… |
… | …11110000010000000100011 |
3 | 11002011012000021002122011101 |
4 | 13010232121332002000203 |
5 | 13034210343003101011 |
6 | 150100113243455231 |
7 | 6360461233541506 |
oct | 704563176020043 |
9 | 132135007078141 |
10 | 31111031300131 |
11 | 9a05129119112 |
12 | 35a5639527517 |
13 | 14489b0780843 |
14 | 797ad395113d |
15 | 38e408e4d2c1 |
hex | 1c4b99f82023 |
31111031300131 has 32 divisors (see below), whose sum is σ = 32592186316800. Its totient is φ = 29667569742720.
The previous prime is 31111031300117. The next prime is 31111031300143. The reversal of 31111031300131 is 13100313011113.
It is a cyclic number.
It is not a de Polignac number, because 31111031300131 - 27 = 31111031300003 is a prime.
It is a super-2 number, since 2×311110313001312 (a number of 28 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 = 31111031300099 and 31111031300108.
It is not an unprimeable number, because it can be changed into a prime (31111031300191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2408154490 + ... + 2408167408.
It is an arithmetic number, because the mean of its divisors is an integer number (1018505822400).
Almost surely, 231111031300131 is an apocalyptic number.
31111031300131 is a deficient number, since it is larger than the sum of its proper divisors (1481155016669).
31111031300131 is a wasteful number, since it uses less digits than its factorization.
31111031300131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15859.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 31111031300131 its reverse (13100313011113), we get a palindrome (44211344311244).
The spelling of 31111031300131 in words is "thirty-one trillion, one hundred eleven billion, thirty-one million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •