Base | Representation |
---|---|
bin | 110100010010110101… |
… | …1000101101011001011 |
3 | 101201212110112011020100 |
4 | 1220211223011223023 |
5 | 3314443101431443 |
6 | 123331312300443 |
7 | 11053633316355 |
oct | 1504553055313 |
9 | 351773464210 |
10 | 112301202123 |
11 | 43699112350 |
12 | 19921541723 |
13 | a7891a3276 |
14 | 5614a860d5 |
15 | 2dc41553d3 |
hex | 1a25ac5acb |
112301202123 has 12 divisors (see below), whose sum is σ = 176959470168. Its totient is φ = 68061334560.
The previous prime is 112301202067. The next prime is 112301202127. The reversal of 112301202123 is 321202103211.
It is not a de Polignac number, because 112301202123 - 212 = 112301198027 is a prime.
It is a super-2 number, since 2×1123012021232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112301202096 and 112301202105.
It is not an unprimeable number, because it can be changed into a prime (112301202127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 567177690 + ... + 567177887.
It is an arithmetic number, because the mean of its divisors is an integer number (14746622514).
Almost surely, 2112301202123 is an apocalyptic number.
112301202123 is a deficient number, since it is larger than the sum of its proper divisors (64658268045).
112301202123 is a wasteful number, since it uses less digits than its factorization.
112301202123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134355594 (or 1134355591 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 112301202123 its reverse (321202103211), we get a palindrome (433503305334).
The spelling of 112301202123 in words is "one hundred twelve billion, three hundred one million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •