Base | Representation |
---|---|
bin | 10000000010100111100… |
… | …001111101001000100000 |
3 | 10220101021201221001100202 |
4 | 100002213201331020200 |
5 | 121030024003332000 |
6 | 2202222213004332 |
7 | 142432401104312 |
oct | 20024741751040 |
9 | 3811251831322 |
10 | 1102322324000 |
11 | 39554623a427 |
12 | 1597796236a8 |
13 | 7cc43c685a1 |
14 | 3b4d1aa77b2 |
15 | 1da197d1dd5 |
hex | 100a787d220 |
1102322324000 has 96 divisors (see below), whose sum is σ = 2748830587776. Its totient is φ = 434347795200.
The previous prime is 1102322323967. The next prime is 1102322324023. The reversal of 1102322324000 is 4232232011.
It is a super-2 number, since 2×11023223240002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1788572 + ... + 2324571.
It is an arithmetic number, because the mean of its divisors is an integer number (28633651956).
Almost surely, 21102322324000 is an apocalyptic number.
1102322324000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102322324000 is an abundant number, since it is smaller than the sum of its proper divisors (1646508263776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102322324000 is an equidigital number, since it uses as much as digits as its factorization.
1102322324000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4113235 (or 4113217 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1102322324000 its reverse (4232232011), we get a palindrome (1106554556011).
The spelling of 1102322324000 in words is "one trillion, one hundred two billion, three hundred twenty-two million, three hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •