Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1110001100011110000 |
3 | 101121120011202110111200 |
4 | 1213121103301203300 |
5 | 3304332111201000 |
6 | 123000224211200 |
7 | 11010115421346 |
oct | 1473123614360 |
9 | 347504673450 |
10 | 111020022000 |
11 | 430a09a97a8 |
12 | 19624469b00 |
13 | a613927514 |
14 | 5532863996 |
15 | 2d4b931500 |
hex | 19d94f18f0 |
111020022000 has 120 divisors (see below), whose sum is σ = 387755993040. Its totient is φ = 29605334400.
The previous prime is 111020021939. The next prime is 111020022037. The reversal of 111020022000 is 220020111.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3065890 + ... + 3101889.
It is an arithmetic number, because the mean of its divisors is an integer number (3231299942).
Almost surely, 2111020022000 is an apocalyptic number.
111020022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111020022000 is an abundant number, since it is smaller than the sum of its proper divisors (276735971040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111020022000 is a wasteful number, since it uses less digits than its factorization.
111020022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6167808 (or 6167789 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 111020022000 its reverse (220020111), we get a palindrome (111240042111).
The spelling of 111020022000 in words is "one hundred eleven billion, twenty million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •