Base | Representation |
---|---|
bin | 1010000110000110111010… |
… | …00101001100001010011000 |
3 | 2220121022100010222012121001 |
4 | 11003003131011030022120 |
5 | 10402211301112023000 |
6 | 115114330222554344 |
7 | 4450622114300530 |
oct | 503033505141230 |
9 | 86538303865531 |
10 | 22200100111000 |
11 | 708a011836989 |
12 | 25a66407389b4 |
13 | c505ca819446 |
14 | 56a6c220c4c0 |
15 | 28771eeb046a |
hex | 1430dd14c298 |
22200100111000 has 128 divisors (see below), whose sum is σ = 59371673362560. Its totient is φ = 7611172800000.
The previous prime is 22200100110967. The next prime is 22200100111001. The reversal of 22200100111000 is 11100100222.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200100111001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 269465814 + ... + 269548186.
It is an arithmetic number, because the mean of its divisors is an integer number (463841198145).
Almost surely, 222200100111000 is an apocalyptic number.
22200100111000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22200100111000 is an abundant number, since it is smaller than the sum of its proper divisors (37171573251560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22200100111000 is a wasteful number, since it uses less digits than its factorization.
22200100111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120902 (or 120888 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 22200100111000 its reverse (11100100222), we get a palindrome (22211200211222).
The spelling of 22200100111000 in words is "twenty-two trillion, two hundred billion, one hundred million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •