Base | Representation |
---|---|
bin | 10000010101001000011… |
… | …101010010011000110100 |
3 | 10222021121012020101001220 |
4 | 100111020131102120310 |
5 | 121341232214220200 |
6 | 2215311005350340 |
7 | 144035133321600 |
oct | 20251035223064 |
9 | 3867535211056 |
10 | 1122202101300 |
11 | 3a2a17915345 |
12 | 1615a72683b0 |
13 | 81a9176bb17 |
14 | 3c45a016500 |
15 | 1e2cec014a0 |
hex | 10548752634 |
1122202101300 has 108 divisors (see below), whose sum is σ = 3777011693280. Its totient is φ = 256503334080.
The previous prime is 1122202101289. The next prime is 1122202101301. The reversal of 1122202101300 is 31012022211.
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 1122202101300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122202101301) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 38155440 + ... + 38184839.
Almost surely, 21122202101300 is an apocalyptic number.
1122202101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122202101300 is an abundant number, since it is smaller than the sum of its proper divisors (2654809591980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122202101300 is a wasteful number, since it uses less digits than its factorization.
1122202101300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76340310 (or 76340296 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1122202101300 its reverse (31012022211), we get a palindrome (1153214123511).
The spelling of 1122202101300 in words is "one trillion, one hundred twenty-two billion, two hundred two million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •