Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …101010101010101111011 |
3 | 10221010101121122020001000 |
4 | 100021313311111111323 |
5 | 121142002140011443 |
6 | 2205551201300043 |
7 | 143126416403523 |
oct | 20116765252573 |
9 | 3833347566030 |
10 | 1110112032123 |
11 | 398883335436 |
12 | 15b192334623 |
13 | 808b5a5ca33 |
14 | 3ba30470683 |
15 | 1dd235dd8d3 |
hex | 10277d5557b |
1110112032123 has 8 divisors (see below), whose sum is σ = 1644610418000. Its totient is φ = 740074688064.
The previous prime is 1110112032097. The next prime is 1110112032131. The reversal of 1110112032123 is 3212302110111.
It is not a de Polignac number, because 1110112032123 - 26 = 1110112032059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110112032096 and 1110112032105.
It is not an unprimeable number, because it can be changed into a prime (1110112032023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20557630198 + ... + 20557630251.
It is an arithmetic number, because the mean of its divisors is an integer number (205576302250).
Almost surely, 21110112032123 is an apocalyptic number.
1110112032123 is a deficient number, since it is larger than the sum of its proper divisors (534498385877).
1110112032123 is an equidigital number, since it uses as much as digits as its factorization.
1110112032123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41115260458 (or 41115260452 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1110112032123 its reverse (3212302110111), we get a palindrome (4322414142234).
The spelling of 1110112032123 in words is "one trillion, one hundred ten billion, one hundred twelve million, thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •