Base | Representation |
---|---|
bin | 10000010101001001000… |
… | …000000000010000110100 |
3 | 10222021121211100202000120 |
4 | 100111021000000100310 |
5 | 121341242031431400 |
6 | 2215311532411540 |
7 | 144035303554542 |
oct | 20251100002064 |
9 | 3867554322016 |
10 | 1122211202100 |
11 | 3a2a21a7096a |
12 | 1615aa316bb0 |
13 | 81a93607301 |
14 | 3c45b304d92 |
15 | 1e2d08ecca0 |
hex | 10549000434 |
1122211202100 has 36 divisors (see below), whose sum is σ = 3246931078944. Its totient is φ = 299256320480.
The previous prime is 1122211202081. The next prime is 1122211202107. The reversal of 1122211202100 is 12021122211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1122211202100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122211202107) 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, 1870351704 + ... + 1870352303.
Almost surely, 21122211202100 is an apocalyptic number.
1122211202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122211202100 is an abundant number, since it is smaller than the sum of its proper divisors (2124719876844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122211202100 is a wasteful number, since it uses less digits than its factorization.
1122211202100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3740704024 (or 3740704017 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1122211202100 its reverse (12021122211), we get a palindrome (1134232324311).
The spelling of 1122211202100 in words is "one trillion, one hundred twenty-two billion, two hundred eleven million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •