Base | Representation |
---|---|
bin | 1010000001011110111101… |
… | …0101101100000001100010 |
3 | 1110000120010000112002111220 |
4 | 2200113233111230001202 |
5 | 2421030200234213320 |
6 | 35234444033315510 |
7 | 2215132622045001 |
oct | 240275725540142 |
9 | 43016100462456 |
10 | 11020606554210 |
11 | 35698a4103100 |
12 | 129ba4aa05b96 |
13 | 61c3146808b6 |
14 | 2a158622cc38 |
15 | 141a107d9e40 |
hex | a05ef56c062 |
11020606554210 has 192 divisors, whose sum is σ = 29788968246912. Its totient is φ = 2605857408000.
The previous prime is 11020606554203. The next prime is 11020606554253. The reversal of 11020606554210 is 1245560602011.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 906517452 + ... + 906529608.
It is an arithmetic number, because the mean of its divisors is an integer number (155150876286).
Almost surely, 211020606554210 is an apocalyptic number.
11020606554210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11020606554210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14894484123456).
11020606554210 is an abundant number, since it is smaller than the sum of its proper divisors (18768361692702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020606554210 is a wasteful number, since it uses less digits than its factorization.
11020606554210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18321 (or 18310 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The spelling of 11020606554210 in words is "eleven trillion, twenty billion, six hundred six million, five hundred fifty-four thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •