Base | Representation |
---|---|
bin | 10100011111100011… |
… | …01100010101010000 |
3 | 1001101202101202011202 |
4 | 22033301230111100 |
5 | 140013014244440 |
6 | 5015421130332 |
7 | 536433222251 |
oct | 121761542520 |
9 | 31352352152 |
10 | 11002103120 |
11 | 4736444a08 |
12 | 21706b99a8 |
13 | 10644b29b8 |
14 | 76529ab28 |
15 | 445d57615 |
hex | 28fc6c550 |
11002103120 has 80 divisors (see below), whose sum is σ = 25870344192. Its totient is φ = 4351127040.
The previous prime is 11002103117. The next prime is 11002103137. The reversal of 11002103120 is 2130120011.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×110021031202 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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, 3068849 + ... + 3072431.
Almost surely, 211002103120 is an apocalyptic number.
11002103120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11002103120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12935172096).
11002103120 is an abundant number, since it is smaller than the sum of its proper divisors (14868241072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002103120 is a wasteful number, since it uses less digits than its factorization.
11002103120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4020 (or 4014 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11002103120 its reverse (2130120011), we get a palindrome (13132223131).
The spelling of 11002103120 in words is "eleven billion, two million, one hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •