Base | Representation |
---|---|
bin | 11001011101110100010100… |
… | …110110110110101110000111 |
3 | 112200120010010100111112100122 |
4 | 121131310110312312232013 |
5 | 104140002413244231043 |
6 | 1034112104230532155 |
7 | 32406514444045100 |
oct | 3135642466665607 |
9 | 480503110445318 |
10 | 112000212102023 |
11 | 3276102898a403 |
12 | 1068a48450705b |
13 | 4a6576176938b |
14 | 1d92ba6a433a7 |
15 | ce35b113a368 |
hex | 65dd14db6b87 |
112000212102023 has 6 divisors (see below), whose sum is σ = 130285961016696. Its totient is φ = 96000181801692.
The previous prime is 112000212101993. The next prime is 112000212102059. The reversal of 112000212102023 is 320201212000211.
It is not a de Polignac number, because 112000212102023 - 212 = 112000212097927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112000212101992 and 112000212102010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000212102073) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1142859307115 + ... + 1142859307212.
It is an arithmetic number, because the mean of its divisors is an integer number (21714326836116).
Almost surely, 2112000212102023 is an apocalyptic number.
112000212102023 is a deficient number, since it is larger than the sum of its proper divisors (18285748914673).
112000212102023 is an equidigital number, since it uses as much as digits as its factorization.
112000212102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2285718614341 (or 2285718614334 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 112000212102023 its reverse (320201212000211), we get a palindrome (432201424102234).
The spelling of 112000212102023 in words is "one hundred twelve trillion, two hundred twelve million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •