Base | Representation |
---|---|
bin | 1110001001101101111001… |
… | …00001101010010010110001 |
3 | 11002012001200022111122210020 |
4 | 13010312330201222102301 |
5 | 13034333132424000423 |
6 | 150104231210154053 |
7 | 6361234406651631 |
oct | 704667441522261 |
9 | 132161608448706 |
10 | 31120201000113 |
11 | 9a09004187465 |
12 | 35a7378422929 |
13 | 1449812439714 |
14 | 7983236dc6c1 |
15 | 38e793e9b4e3 |
hex | 1c4dbc86a4b1 |
31120201000113 has 8 divisors (see below), whose sum is σ = 41567302226208. Its totient is φ = 20709950220384.
The previous prime is 31120201000087. The next prime is 31120201000117. The reversal of 31120201000113 is 31100010202113.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31120201000113 - 28 = 31120200999857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31120201000092 and 31120201000101.
It is not an unprimeable number, because it can be changed into a prime (31120201000117) 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, 9212609620 + ... + 9212612997.
It is an arithmetic number, because the mean of its divisors is an integer number (5195912778276).
Almost surely, 231120201000113 is an apocalyptic number.
It is an amenable number.
31120201000113 is a deficient number, since it is larger than the sum of its proper divisors (10447101226095).
31120201000113 is a wasteful number, since it uses less digits than its factorization.
31120201000113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18425223183.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 31120201000113 its reverse (31100010202113), we get a palindrome (62220211202226).
The spelling of 31120201000113 in words is "thirty-one trillion, one hundred twenty billion, two hundred one million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •