Base | Representation |
---|---|
bin | 11001011101110100010101… |
… | …011000110101100100100010 |
3 | 112200120010010222021010002111 |
4 | 121131310111120311210202 |
5 | 104140002423034311320 |
6 | 1034112105145505534 |
7 | 32406514612546351 |
oct | 3135642530654442 |
9 | 480503128233074 |
10 | 112000221010210 |
11 | 32761032a14245 |
12 | 1068a4874a22aa |
13 | 4a65763567cb0 |
14 | 1d92ba7cc1998 |
15 | ce35b1ce9a5a |
hex | 65dd15635922 |
112000221010210 has 32 divisors (see below), whose sum is σ = 217111621475952. Its totient is φ = 41353260948480.
The previous prime is 112000221010187. The next prime is 112000221010231. The reversal of 112000221010210 is 12010122000211.
It can be written as a sum of positive squares in 8 ways, for example, as 21415301862889 + 90584919147321 = 4627667^2 + 9517611^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1183830 + ... + 15013390.
Almost surely, 2112000221010210 is an apocalyptic number.
112000221010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112000221010210 is a deficient number, since it is larger than the sum of its proper divisors (105111400465742).
112000221010210 is a wasteful number, since it uses less digits than its factorization.
112000221010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13891878.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112000221010210 its reverse (12010122000211), we get a palindrome (124010343010421).
Subtracting from 112000221010210 its reverse (12010122000211), we obtain a palindrome (99990099009999).
The spelling of 112000221010210 in words is "one hundred twelve trillion, two hundred twenty-one million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •