Base | Representation |
---|---|
bin | 11001100010001100011101… |
… | …111011110101001111000010 |
3 | 112201121212112121210021220211 |
4 | 121202030131323311033002 |
5 | 104204414433100043242 |
6 | 1034502212303024334 |
7 | 32440323524666125 |
oct | 3142143573651702 |
9 | 481555477707824 |
10 | 112301012112322 |
11 | 32867656724240 |
12 | 1071883189b0aa |
13 | 4a87c2b252757 |
14 | 1da35801143bc |
15 | ceb318b74317 |
hex | 66231def53c2 |
112301012112322 has 16 divisors (see below), whose sum is σ = 183769522781472. Its totient is φ = 51044739531520.
The previous prime is 112301012112293. The next prime is 112301012112323. The reversal of 112301012112322 is 223211210103211.
It is a happy number.
It is a super-2 number, since 2×1123010121123222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 112301012112293 and 112301012112302.
It is not an unprimeable number, because it can be changed into a prime (112301012112323) 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, 57775468 + ... + 59687575.
It is an arithmetic number, because the mean of its divisors is an integer number (11485595173842).
Almost surely, 2112301012112322 is an apocalyptic number.
112301012112322 is a deficient number, since it is larger than the sum of its proper divisors (71468510669150).
112301012112322 is a wasteful number, since it uses less digits than its factorization.
112301012112322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117506513.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 112301012112322 its reverse (223211210103211), we get a palindrome (335512222215533).
The spelling of 112301012112322 in words is "one hundred twelve trillion, three hundred one billion, twelve million, one hundred twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •