Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …1011010010111011001010 |
3 | 1102222122121100001212021210 |
4 | 2200032321123102323022 |
5 | 2420401224200320020 |
6 | 35230233550513550 |
7 | 2214345423510552 |
oct | 240167133227312 |
9 | 42878540055253 |
10 | 11011112120010 |
11 | 3565871807172 |
12 | 129a03b2058b6 |
13 | 61b4606469b2 |
14 | 2a0d252b0162 |
15 | 141656ee43e0 |
hex | a03b96d2eca |
11011112120010 has 32 divisors (see below), whose sum is σ = 26426756488320. Its totient is φ = 2936286854208.
The previous prime is 11011112119993. The next prime is 11011112120059. The reversal of 11011112120010 is 1002121111011.
11011112120010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×110111121200102 (a number of 27 digits) contains 22 as substring.
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, 16785771 + ... + 17429409.
It is an arithmetic number, because the mean of its divisors is an integer number (825836140260).
Almost surely, 211011112120010 is an apocalyptic number.
11011112120010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011112120010 is an abundant number, since it is smaller than the sum of its proper divisors (15415644368310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011112120010 is a wasteful number, since it uses less digits than its factorization.
11011112120010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1213902.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11011112120010 its reverse (1002121111011), we get a palindrome (12013233231021).
The spelling of 11011112120010 in words is "eleven trillion, eleven billion, one hundred twelve million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •