Base | Representation |
---|---|
bin | 1110001001100001000010… |
… | …10101010010010000000011 |
3 | 11002011101212112102101221020 |
4 | 13010300201111102100003 |
5 | 13034230020343221011 |
6 | 150101130451400523 |
7 | 6360601431103203 |
oct | 704604125222003 |
9 | 132141775371836 |
10 | 31113302320131 |
11 | 9a06094046049 |
12 | 35a5b71bb3143 |
13 | 1448c8311a065 |
14 | 797c6b3d8403 |
15 | 38e4dd4e8006 |
hex | 1c4c21552403 |
31113302320131 has 8 divisors (see below), whose sum is σ = 41492603232960. Its totient is φ = 20738101477032.
The previous prime is 31113302320129. The next prime is 31113302320151. The reversal of 31113302320131 is 13102320331113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31113302320131 - 21 = 31113302320129 is a prime.
It is a super-3 number, since 3×311133023201313 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (31113302320151) 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, 1024999725 + ... + 1025030078.
It is an arithmetic number, because the mean of its divisors is an integer number (5186575404120).
Almost surely, 231113302320131 is an apocalyptic number.
31113302320131 is a deficient number, since it is larger than the sum of its proper divisors (10379300912829).
31113302320131 is a wasteful number, since it uses less digits than its factorization.
31113302320131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2050034865.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31113302320131 its reverse (13102320331113), we get a palindrome (44215622651244).
The spelling of 31113302320131 in words is "thirty-one trillion, one hundred thirteen billion, three hundred two million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •