Base | Representation |
---|---|
bin | 10000010100010011111… |
… | …000011100111111111000 |
3 | 10222012022201110111222220 |
4 | 100110103320130333320 |
5 | 121332430411431300 |
6 | 2215043255444040 |
7 | 144004232664666 |
oct | 20242370347770 |
9 | 3865281414886 |
10 | 1121320030200 |
11 | 3a2604a19267 |
12 | 16139b986620 |
13 | 81980ab1c66 |
14 | 3c3b4c05c36 |
15 | 1e27c566da0 |
hex | 10513e1cff8 |
1121320030200 has 48 divisors (see below), whose sum is σ = 3476092095480. Its totient is φ = 299018674560.
The previous prime is 1121320030183. The next prime is 1121320030213. The reversal of 1121320030200 is 20300231211.
It is a super-2 number, since 2×11213200302002 (a number of 25 digits) contains 22 as substring.
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 1121320030200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 934432759 + ... + 934433958.
Almost surely, 21121320030200 is an apocalyptic number.
1121320030200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121320030200 is an abundant number, since it is smaller than the sum of its proper divisors (2354772065280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121320030200 is a wasteful number, since it uses less digits than its factorization.
1121320030200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1868866736 (or 1868866727 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1121320030200 its reverse (20300231211), we get a palindrome (1141620261411).
The spelling of 1121320030200 in words is "one trillion, one hundred twenty-one billion, three hundred twenty million, thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •