Base | Representation |
---|---|
bin | 11001011110010010000010… |
… | …101101111001110010011011 |
3 | 112200200011111001212201100002 |
4 | 121132102002231321302123 |
5 | 104141013240211120443 |
6 | 1034134502340203215 |
7 | 32412024241632302 |
oct | 3136220255716233 |
9 | 480604431781302 |
10 | 112032120020123 |
11 | 32773612097556 |
12 | 106946aa39950b |
13 | 4a687781a80a4 |
14 | 1d94552617439 |
15 | ce432c4d82b8 |
hex | 65e482b79c9b |
112032120020123 has 12 divisors (see below), whose sum is σ = 115142846502600. Its totient is φ = 109003281653952.
The previous prime is 112032120020083. The next prime is 112032120020147. The reversal of 112032120020123 is 321020021230211.
It is a de Polignac number, because none of the positive numbers 2k-112032120020123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112032120020095 and 112032120020104.
It is not an unprimeable number, because it can be changed into a prime (112032123020123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 198816428 + ... + 199379126.
It is an arithmetic number, because the mean of its divisors is an integer number (9595237208550).
Almost surely, 2112032120020123 is an apocalyptic number.
112032120020123 is a deficient number, since it is larger than the sum of its proper divisors (3110726482477).
112032120020123 is an equidigital number, since it uses as much as digits as its factorization.
112032120020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708206 (or 708169 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112032120020123 its reverse (321020021230211), we get a palindrome (433052141250334).
The spelling of 112032120020123 in words is "one hundred twelve trillion, thirty-two billion, one hundred twenty million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •