Base | Representation |
---|---|
bin | 110010010001100110100110… |
… | …010101011101101110011100 |
3 | 1001222220002201121001121112020 |
4 | 302101212212111131232130 |
5 | 212440144340003310022 |
6 | 2102133241301540140 |
7 | 64400546351432001 |
oct | 6221464625355634 |
9 | 1058802647047466 |
10 | 221112002010012 |
11 | 644a9089836113 |
12 | 20970ba2114650 |
13 | 964ba06a37549 |
14 | 3c85c4132b8a8 |
15 | 1a8696d3e235c |
hex | c919a655db9c |
221112002010012 has 12 divisors (see below), whose sum is σ = 515928004690056. Its totient is φ = 73704000670000.
The previous prime is 221112002009957. The next prime is 221112002010023. The reversal of 221112002010012 is 210010200211122.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 221112002009973 and 221112002010000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9213000083739 + ... + 9213000083762.
It is an arithmetic number, because the mean of its divisors is an integer number (42994000390838).
Almost surely, 2221112002010012 is an apocalyptic number.
It is an amenable number.
221112002010012 is an abundant number, since it is smaller than the sum of its proper divisors (294816002680044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221112002010012 is a wasteful number, since it uses less digits than its factorization.
221112002010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18426000167508 (or 18426000167506 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 221112002010012 its reverse (210010200211122), we get a palindrome (431122202221134).
The spelling of 221112002010012 in words is "two hundred twenty-one trillion, one hundred twelve billion, two million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •