Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1001010111010000110110 |
3 | 1102222122121212220022111010 |
4 | 2200032321321113100312 |
5 | 2420401233210031402 |
6 | 35230234431453050 |
7 | 2214345550506453 |
oct | 240167171272066 |
9 | 42878555808433 |
10 | 11011120002102 |
11 | 35658762000a0 |
12 | 129a041987186 |
13 | 61b46217655c |
14 | 2a0d2636282a |
15 | 141657a4ea6c |
hex | a03b9e57436 |
11011120002102 has 64 divisors (see below), whose sum is σ = 24436636139520. Its totient is φ = 3279452820000.
The previous prime is 11011120002089. The next prime is 11011120002121. The reversal of 11011120002102 is 20120002111011.
11011120002102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18202803 + ... + 18797985.
It is an arithmetic number, because the mean of its divisors is an integer number (381822439680).
Almost surely, 211011120002102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11011120002102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12218318069760).
11011120002102 is an abundant number, since it is smaller than the sum of its proper divisors (13425516137418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011120002102 is a wasteful number, since it uses less digits than its factorization.
11011120002102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 600009.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11011120002102 its reverse (20120002111011), we get a palindrome (31131122113113).
The spelling of 11011120002102 in words is "eleven trillion, eleven billion, one hundred twenty million, two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •