Base | Representation |
---|---|
bin | 110011101100101100… |
… | …0010110000100000110 |
3 | 101121120021000022222211 |
4 | 1213121120112010012 |
5 | 3304332413020402 |
6 | 123000310014034 |
7 | 11010131541352 |
oct | 1473130260406 |
9 | 347507008884 |
10 | 111021220102 |
11 | 430a1647971 |
12 | 1962494731a |
13 | a613c56960 |
14 | 5532a96462 |
15 | 2d4babb4d7 |
hex | 19d9616106 |
111021220102 has 32 divisors (see below), whose sum is σ = 190539814752. Its totient is φ = 48061761024.
The previous prime is 111021220067. The next prime is 111021220139. The reversal of 111021220102 is 201022120111.
It is a super-2 number, since 2×1110212201022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 299128 + ... + 558139.
It is an arithmetic number, because the mean of its divisors is an integer number (5954369211).
Almost surely, 2111021220102 is an apocalyptic number.
111021220102 is a deficient number, since it is larger than the sum of its proper divisors (79518594650).
111021220102 is a wasteful number, since it uses less digits than its factorization.
111021220102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 857592.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 111021220102 its reverse (201022120111), we get a palindrome (312043340213).
Subtracting 111021220102 from its reverse (201022120111), we obtain a palindrome (90000900009).
The spelling of 111021220102 in words is "one hundred eleven billion, twenty-one million, two hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •