Base | Representation |
---|---|
bin | 110100101011100100… |
… | …0100011110000110011 |
3 | 101211000021221211012000 |
4 | 1221113020203300303 |
5 | 3323143014323443 |
6 | 123545514105043 |
7 | 11113330504524 |
oct | 1512710436063 |
9 | 354007854160 |
10 | 113131011123 |
11 | 43a84563109 |
12 | 19b1341b183 |
13 | a88c092200 |
14 | 5692d7084b |
15 | 2e21e198d3 |
hex | 1a57223c33 |
113131011123 has 24 divisors (see below), whose sum is σ = 181485653040. Its totient is φ = 69619080960.
The previous prime is 113131011113. The next prime is 113131011139. The reversal of 113131011123 is 321110131311.
It is not a de Polignac number, because 113131011123 - 212 = 113131007027 is a prime.
It is a super-2 number, since 2×1131310111232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113131011096 and 113131011105.
It is not an unprimeable number, because it can be changed into a prime (113131011113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12391998 + ... + 12401123.
It is an arithmetic number, because the mean of its divisors is an integer number (7561902210).
Almost surely, 2113131011123 is an apocalyptic number.
113131011123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
113131011123 is a deficient number, since it is larger than the sum of its proper divisors (68354641917).
113131011123 is a wasteful number, since it uses less digits than its factorization.
113131011123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24793156 (or 24793137 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 113131011123 its reverse (321110131311), we get a palindrome (434241142434).
The spelling of 113131011123 in words is "one hundred thirteen billion, one hundred thirty-one million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •