Base | Representation |
---|---|
bin | 11001011110001000110100… |
… | …001010100110110110110111 |
3 | 112200122012220120120211002102 |
4 | 121132020310022212312313 |
5 | 104140332442311210403 |
6 | 1034130143245332315 |
7 | 32411223563633636 |
oct | 3136106412466667 |
9 | 480565816524072 |
10 | 112022212210103 |
11 | 3276a39841a208 |
12 | 106927a426709b |
13 | 4a67859628600 |
14 | 1d93c9281151d |
15 | ce3e4c78ab88 |
hex | 65e2342a6db7 |
112022212210103 has 24 divisors (see below), whose sum is σ = 125219630572416. Its totient is φ = 100065874521600.
The previous prime is 112022212210091. The next prime is 112022212210109. The reversal of 112022212210103 is 301012212220211.
It is not a de Polignac number, because 112022212210103 - 28 = 112022212209847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112022212210109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 151147451 + ... + 151886787.
It is an arithmetic number, because the mean of its divisors is an integer number (5217484607184).
Almost surely, 2112022212210103 is an apocalyptic number.
112022212210103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
112022212210103 is a deficient number, since it is larger than the sum of its proper divisors (13197418362313).
112022212210103 is a wasteful number, since it uses less digits than its factorization.
112022212210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768315 (or 768302 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 112022212210103 its reverse (301012212220211), we get a palindrome (413034424430314).
The spelling of 112022212210103 in words is "one hundred twelve trillion, twenty-two billion, two hundred twelve million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •