Base | Representation |
---|---|
bin | 1100111011011011111… |
… | …0001111100100010101 |
3 | 210020022102222122212221 |
4 | 3032312332033210111 |
5 | 12114341423231401 |
6 | 250012022342341 |
7 | 22022112134302 |
oct | 3166676174425 |
9 | 706272878787 |
10 | 222113102101 |
11 | 8621a0680a0 |
12 | 3706928a9b1 |
13 | 17c39721487 |
14 | aa70ca40a9 |
15 | 5b9e9947a1 |
hex | 33b6f8f915 |
222113102101 has 16 divisors (see below), whose sum is σ = 248843197440. Its totient is φ = 196520679280.
The previous prime is 222113102083. The next prime is 222113102117. The reversal of 222113102101 is 101201311222.
It is a cyclic number.
It is not a de Polignac number, because 222113102101 - 25 = 222113102069 is a prime.
It is a super-3 number, since 3×2221131021013 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222113102171) by changing a digit.
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, 1107511 + ... + 1292596.
It is an arithmetic number, because the mean of its divisors is an integer number (15552699840).
Almost surely, 2222113102101 is an apocalyptic number.
It is an amenable number.
222113102101 is a deficient number, since it is larger than the sum of its proper divisors (26730095339).
222113102101 is a wasteful number, since it uses less digits than its factorization.
222113102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400344.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 222113102101 its reverse (101201311222), we get a palindrome (323314413323).
The spelling of 222113102101 in words is "two hundred twenty-two billion, one hundred thirteen million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •