Base | Representation |
---|---|
bin | 110011110010101011… |
… | …1000001011011010101 |
3 | 101122002021012011121112 |
4 | 1213211113001123111 |
5 | 3310240340400041 |
6 | 123032245424405 |
7 | 11015122046552 |
oct | 1474527013325 |
9 | 348067164545 |
10 | 111222200021 |
11 | 4319503a079 |
12 | 1968010b105 |
13 | a646794c9a |
14 | 5551651a29 |
15 | 2d5e56adeb |
hex | 19e55c16d5 |
111222200021 has 8 divisors (see below), whose sum is σ = 116470972224. Its totient is φ = 106007846560.
The previous prime is 111222200017. The next prime is 111222200071. The reversal of 111222200021 is 120002222111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111222200021 - 22 = 111222200017 is a prime.
It is a super-2 number, since 2×1112222000212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111222199969 and 111222200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111222200071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8598071 + ... + 8610996.
It is an arithmetic number, because the mean of its divisors is an integer number (14558871528).
Almost surely, 2111222200021 is an apocalyptic number.
It is an amenable number.
111222200021 is a deficient number, since it is larger than the sum of its proper divisors (5248772203).
111222200021 is a wasteful number, since it uses less digits than its factorization.
111222200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17209371.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 111222200021 its reverse (120002222111), we get a palindrome (231224422132).
The spelling of 111222200021 in words is "one hundred eleven billion, two hundred twenty-two million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •