Base | Representation |
---|---|
bin | 11100111000100001… |
… | …100101101001010001 |
3 | 2222001100121201110112 |
4 | 130320201211221101 |
5 | 1002003323200423 |
6 | 22125222211105 |
7 | 2145351000332 |
oct | 347041455121 |
9 | 88040551415 |
10 | 31013100113 |
11 | 121750a5156 |
12 | 6016283a95 |
13 | 2c0323ac18 |
14 | 1702c06289 |
15 | c17a46a78 |
hex | 738865a51 |
31013100113 has 4 divisors (see below), whose sum is σ = 32645368560. Its totient is φ = 29380831668.
The previous prime is 31013100109. The next prime is 31013100121. The reversal of 31013100113 is 31100131013.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31100131013 = 7 ⋅4442875859.
It is a cyclic number.
It is not a de Polignac number, because 31013100113 - 22 = 31013100109 is a prime.
It is a super-2 number, since 2×310131001132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31013100143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 816134195 + ... + 816134232.
It is an arithmetic number, because the mean of its divisors is an integer number (8161342140).
Almost surely, 231013100113 is an apocalyptic number.
It is an amenable number.
31013100113 is a deficient number, since it is larger than the sum of its proper divisors (1632268447).
31013100113 is a wasteful number, since it uses less digits than its factorization.
31013100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1632268446.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 31013100113 its reverse (31100131013), we get a palindrome (62113231126).
The spelling of 31013100113 in words is "thirty-one billion, thirteen million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •