Base | Representation |
---|---|
bin | 110100101011100010… |
… | …0101111010110101111 |
3 | 101211000020001221221112 |
4 | 1221113010233112233 |
5 | 3323142240310111 |
6 | 123545440422235 |
7 | 11113316135063 |
oct | 1512704572657 |
9 | 354006057845 |
10 | 113130010031 |
11 | 43a83a39a65 |
12 | 19b1301797b |
13 | a88bb0164c |
14 | 5692b8daa3 |
15 | 2e21cbce8b |
hex | 1a5712f5af |
113130010031 has 4 divisors (see below), whose sum is σ = 113181271872. Its totient is φ = 113078748192.
The previous prime is 113130010013. The next prime is 113130010057. The reversal of 113130010031 is 130010031311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113130010031 is a prime.
It is a super-2 number, since 2×1131300100312 (a number of 23 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 = 113130009988 and 113130010015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113130010531) 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, 25627610 + ... + 25632023.
It is an arithmetic number, because the mean of its divisors is an integer number (28295317968).
Almost surely, 2113130010031 is an apocalyptic number.
113130010031 is a deficient number, since it is larger than the sum of its proper divisors (51261841).
113130010031 is an equidigital number, since it uses as much as digits as its factorization.
113130010031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51261840.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 113130010031 its reverse (130010031311), we get a palindrome (243140041342).
The spelling of 113130010031 in words is "one hundred thirteen billion, one hundred thirty million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •