Base | Representation |
---|---|
bin | 10000000010101110101… |
… | …010111111101010111000 |
3 | 10220101121002101001001120 |
4 | 100002232222333222320 |
5 | 121030300141243300 |
6 | 2202242132545240 |
7 | 142435354345221 |
oct | 20025652775270 |
9 | 3811532331046 |
10 | 1102442134200 |
11 | 3955a7931620 |
12 | 1597b1782220 |
13 | 7cc62a26cb4 |
14 | 3b503974248 |
15 | 1da2509b3a0 |
hex | 100aeabfab8 |
1102442134200 has 96 divisors (see below), whose sum is σ = 3728258876160. Its totient is φ = 267258697600.
The previous prime is 1102442134177. The next prime is 1102442134201. The reversal of 1102442134200 is 24312442011.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102442134201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 83511744 + ... + 83524943.
It is an arithmetic number, because the mean of its divisors is an integer number (38836029960).
Almost surely, 21102442134200 is an apocalyptic number.
1102442134200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102442134200 is an abundant number, since it is smaller than the sum of its proper divisors (2625816741960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102442134200 is a wasteful number, since it uses less digits than its factorization.
1102442134200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167036717 (or 167036708 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 1102442134200 its reverse (24312442011), we get a palindrome (1126754576211).
The spelling of 1102442134200 in words is "one trillion, one hundred two billion, four hundred forty-two million, one hundred thirty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •