Base | Representation |
---|---|
bin | 10000010101000011000… |
… | …101100101100010011000 |
3 | 10222021100220200212100012 |
4 | 100111003011211202120 |
5 | 121341041133032300 |
6 | 2215254030301052 |
7 | 144032660434160 |
oct | 20250305454230 |
9 | 3867326625305 |
10 | 1122112002200 |
11 | 3a2980a76582 |
12 | 161581057788 |
13 | 81a78bb3a47 |
14 | 3c44c0815a0 |
15 | 1e2c6d55435 |
hex | 10543165898 |
1122112002200 has 48 divisors (see below), whose sum is σ = 2981611895280. Its totient is φ = 384724114560.
The previous prime is 1122112002181. The next prime is 1122112002203. The reversal of 1122112002200 is 22002112211.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122112002203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 400752887 + ... + 400755686.
It is an arithmetic number, because the mean of its divisors is an integer number (62116914485).
Almost surely, 21122112002200 is an apocalyptic number.
1122112002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122112002200 is an abundant number, since it is smaller than the sum of its proper divisors (1859499893080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122112002200 is a wasteful number, since it uses less digits than its factorization.
1122112002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801508596 (or 801508587 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1122112002200 its reverse (22002112211), we get a palindrome (1144114114411).
The spelling of 1122112002200 in words is "one trillion, one hundred twenty-two billion, one hundred twelve million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •