Base | Representation |
---|---|
bin | 1010000011010100101100… |
… | …0100000010011100100000 |
3 | 1110010120200112100202122102 |
4 | 2200311023010002130200 |
5 | 2422034411302434100 |
6 | 35301152033225532 |
7 | 2220332033450003 |
oct | 240651304023440 |
9 | 43116615322572 |
10 | 11052210202400 |
11 | 358124158a814 |
12 | 12a5baaa022a8 |
13 | 6222b0058143 |
14 | 2a2d0363b53a |
15 | 1427600d3cd5 |
hex | a0d4b102720 |
11052210202400 has 72 divisors (see below), whose sum is σ = 26981753346324. Its totient is φ = 4420794752000.
The previous prime is 11052210202361. The next prime is 11052210202403. The reversal of 11052210202400 is 420201225011.
It can be written as a sum of positive squares in 6 ways, for example, as 6896695336336 + 4155514866064 = 2626156^2 + 2038508^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (11052210202403) 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, 51333374 + ... + 51548226.
Almost surely, 211052210202400 is an apocalyptic number.
11052210202400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11052210202400 is an abundant number, since it is smaller than the sum of its proper divisors (15929543143924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11052210202400 is a wasteful number, since it uses less digits than its factorization.
11052210202400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279174 (or 279161 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 11052210202400 its reverse (420201225011), we get a palindrome (11472411427411).
The spelling of 11052210202400 in words is "eleven trillion, fifty-two billion, two hundred ten million, two hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •