Base | Representation |
---|---|
bin | 1001001100100110111101… |
… | …0101110101100100101101 |
3 | 1022210201102001212020110021 |
4 | 2103021233111311210231 |
5 | 2311134312034311341 |
6 | 33301253514442141 |
7 | 2062404156241231 |
oct | 223115725654455 |
9 | 38721361766407 |
10 | 10112221010221 |
11 | 3249629153a70 |
12 | 1173996433351 |
13 | 584769831c55 |
14 | 26d61129c5c1 |
15 | 1280970079d1 |
hex | 9326f57592d |
10112221010221 has 32 divisors (see below), whose sum is σ = 11812951146240. Its totient is φ = 8554022400000.
The previous prime is 10112221010207. The next prime is 10112221010249. The reversal of 10112221010221 is 12201012221101.
It is not a de Polignac number, because 10112221010221 - 27 = 10112221010093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10112221010195 and 10112221010204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112221010251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 183827721 + ... + 183882721.
It is an arithmetic number, because the mean of its divisors is an integer number (369154723320).
Almost surely, 210112221010221 is an apocalyptic number.
10112221010221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10112221010221 is a deficient number, since it is larger than the sum of its proper divisors (1700730136019).
10112221010221 is a wasteful number, since it uses less digits than its factorization.
10112221010221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66165.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10112221010221 its reverse (12201012221101), we get a palindrome (22313233231322).
The spelling of 10112221010221 in words is "ten trillion, one hundred twelve billion, two hundred twenty-one million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •