Base | Representation |
---|---|
bin | 110010010000000111100111… |
… | …001001010000000001101111 |
3 | 1001222112100110121022101001012 |
4 | 302100013213021100001233 |
5 | 212432012000042041421 |
6 | 2102014332541335435 |
7 | 64360306036544663 |
oct | 6220074711200157 |
9 | 1058470417271035 |
10 | 221010010112111 |
11 | 64469900a97700 |
12 | 2095527926757b |
13 | 96422016594bc |
14 | 3c80d279208a3 |
15 | 1a83e9e39595b |
hex | c901e725006f |
221010010112111 has 24 divisors (see below), whose sum is σ = 244703004653520. Its totient is φ = 199450756897920.
The previous prime is 221010010112093. The next prime is 221010010112119. The reversal of 221010010112111 is 111211010010122.
It is not a de Polignac number, because 221010010112111 - 222 = 221010005917807 is a prime.
It is a super-3 number, since 3×2210100101121113 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221010010112119) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 152888531 + ... + 154327323.
It is an arithmetic number, because the mean of its divisors is an integer number (10195958527230).
Almost surely, 2221010010112111 is an apocalyptic number.
221010010112111 is a deficient number, since it is larger than the sum of its proper divisors (23692994541409).
221010010112111 is a wasteful number, since it uses less digits than its factorization.
221010010112111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1448087 (or 1448076 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 221010010112111 its reverse (111211010010122), we get a palindrome (332221020122233).
The spelling of 221010010112111 in words is "two hundred twenty-one trillion, ten billion, ten million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •