Base | Representation |
---|---|
bin | 1110001001100001000010… |
… | …10101001101010111100011 |
3 | 11002011101212112101101111111 |
4 | 13010300201111031113203 |
5 | 13034230020342101011 |
6 | 150101130451124151 |
7 | 6360601430660662 |
oct | 704604125152743 |
9 | 132141775341444 |
10 | 31113302300131 |
11 | 9a06094032017 |
12 | 35a5b71ba3657 |
13 | 1448c83110c1c |
14 | 797c6b3d0dd9 |
15 | 38e4dd4e2121 |
hex | 1c4c2154d5e3 |
31113302300131 has 8 divisors (see below), whose sum is σ = 31491374281920. Its totient is φ = 30735306816552.
The previous prime is 31113302300123. The next prime is 31113302300147. The reversal of 31113302300131 is 13100320331113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31113302300131 - 23 = 31113302300123 is a prime.
It is a super-2 number, since 2×311133023001312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31113302300111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18305961 + ... + 19933258.
It is an arithmetic number, because the mean of its divisors is an integer number (3936421785240).
Almost surely, 231113302300131 is an apocalyptic number.
31113302300131 is a deficient number, since it is larger than the sum of its proper divisors (378071981789).
31113302300131 is an equidigital number, since it uses as much as digits as its factorization.
31113302300131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38249105.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 31113302300131 its reverse (13100320331113), we get a palindrome (44213622631244).
The spelling of 31113302300131 in words is "thirty-one trillion, one hundred thirteen billion, three hundred two million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •