Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …111111011010011011111 |
3 | 10221022022122220221120200 |
4 | 100023221213323103133 |
5 | 121204404401321343 |
6 | 2210504435514543 |
7 | 143224630364166 |
oct | 20135147732337 |
9 | 3838278827520 |
10 | 1112021120223 |
11 | 399672a285a2 |
12 | 15b625758a53 |
13 | 80b2b426070 |
14 | 3bb71c223dd |
15 | 1ddd5ee44d3 |
hex | 102e99fb4df |
1112021120223 has 24 divisors (see below), whose sum is σ = 1759129466640. Its totient is φ = 672722029440.
The previous prime is 1112021120213. The next prime is 1112021120267. The reversal of 1112021120223 is 3220211202111.
It is not a de Polignac number, because 1112021120223 - 29 = 1112021119711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112021120196 and 1112021120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112021120213) 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, 80539318 + ... + 80553123.
It is an arithmetic number, because the mean of its divisors is an integer number (73297061110).
Almost surely, 21112021120223 is an apocalyptic number.
1112021120223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1112021120223 is a deficient number, since it is larger than the sum of its proper divisors (647108346417).
1112021120223 is a wasteful number, since it uses less digits than its factorization.
1112021120223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161092519 (or 161092516 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1112021120223 its reverse (3220211202111), we get a palindrome (4332232322334).
The spelling of 1112021120223 in words is "one trillion, one hundred twelve billion, twenty-one million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •