Base | Representation |
---|---|
bin | 1001010001110110001100… |
… | …0110100110000011011000 |
3 | 1100010022200120000121220211 |
4 | 2110131203012212003120 |
5 | 2314123111230013422 |
6 | 33410455223100504 |
7 | 2102041163113243 |
oct | 224354306460330 |
9 | 40108616017824 |
10 | 10202210001112 |
11 | 3283807635818 |
12 | 118930b5a1734 |
13 | 5900ab29b25c |
14 | 273b0a93225a |
15 | 12a5b240c577 |
hex | 947631a60d8 |
10202210001112 has 16 divisors (see below), whose sum is σ = 19536146811360. Its totient is φ = 4992570851424.
The previous prime is 10202210001103. The next prime is 10202210001121. The reversal of 10202210001112 is 21110001220201.
It is an interprime number because it is at equal distance from previous prime (10202210001103) and next prime (10202210001121).
It is a junction number, because it is equal to n+sod(n) for n = 10202210001092 and 10202210001101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13566768243 + ... + 13566768994.
It is an arithmetic number, because the mean of its divisors is an integer number (1221009175710).
Almost surely, 210202210001112 is an apocalyptic number.
It is an amenable number.
10202210001112 is a deficient number, since it is larger than the sum of its proper divisors (9333936810248).
10202210001112 is a wasteful number, since it uses less digits than its factorization.
10202210001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27133537290 (or 27133537286 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10202210001112 its reverse (21110001220201), we get a palindrome (31312211221313).
The spelling of 10202210001112 in words is "ten trillion, two hundred two billion, two hundred ten million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •