Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …101010000101010101111 |
3 | 10221022112022111202011000 |
4 | 100023232131100222233 |
5 | 121210041131211343 |
6 | 2210520453531343 |
7 | 143226633550164 |
oct | 20135635205257 |
9 | 3838468452130 |
10 | 1112102210223 |
11 | 399704783724 |
12 | 15b648943b53 |
13 | 80b42178604 |
14 | 3bb7c8d006b |
15 | 1dddd1b0ed3 |
hex | 102ee750aaf |
1112102210223 has 8 divisors (see below), whose sum is σ = 1647558830000. Its totient is φ = 741401473464.
The previous prime is 1112102210213. The next prime is 1112102210237. The reversal of 1112102210223 is 3220122012111.
1112102210223 is a `hidden beast` number, since 1 + 11 + 210 + 221 + 0 + 223 = 666.
It is not a de Polignac number, because 1112102210223 - 26 = 1112102210159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112102210196 and 1112102210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112102210213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20594485348 + ... + 20594485401.
It is an arithmetic number, because the mean of its divisors is an integer number (205944853750).
Almost surely, 21112102210223 is an apocalyptic number.
1112102210223 is a deficient number, since it is larger than the sum of its proper divisors (535456619777).
1112102210223 is an equidigital number, since it uses as much as digits as its factorization.
1112102210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41188970758 (or 41188970752 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1112102210223 its reverse (3220122012111), we get a palindrome (4332224222334).
The spelling of 1112102210223 in words is "one trillion, one hundred twelve billion, one hundred two million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •