Base | Representation |
---|---|
bin | 10000001010111010011… |
… | …110110100000101011000 |
3 | 10221020021112200011000120 |
4 | 100022322132310011120 |
5 | 121201244412432300 |
6 | 2210254143433240 |
7 | 143166214604556 |
oct | 20127236640530 |
9 | 3836245604016 |
10 | 1111230202200 |
11 | 3992a7530138 |
12 | 15b4448b5820 |
13 | 80a33602c31 |
14 | 3bad8b7cbd6 |
15 | 1dd8b8633a0 |
hex | 102ba7b4158 |
1111230202200 has 48 divisors (see below), whose sum is σ = 3444813628680. Its totient is φ = 296328053760.
The previous prime is 1111230202153. The next prime is 1111230202207. The reversal of 1111230202200 is 22020321111.
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 1111230202200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111230202207) 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, 926024569 + ... + 926025768.
Almost surely, 21111230202200 is an apocalyptic number.
1111230202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111230202200 is an abundant number, since it is smaller than the sum of its proper divisors (2333583426480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111230202200 is a wasteful number, since it uses less digits than its factorization.
1111230202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1852050356 (or 1852050347 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1111230202200 its reverse (22020321111), we get a palindrome (1133250523311).
The spelling of 1111230202200 in words is "one trillion, one hundred eleven billion, two hundred thirty million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •