Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …1011000100010011010000 |
3 | 1102221121012000121102121210 |
4 | 2200010221023010103100 |
5 | 2420211202103341422 |
6 | 35221213242020120 |
7 | 2213505532235613 |
oct | 240045113042320 |
9 | 42847160542553 |
10 | 11000102012112 |
11 | 35611318a5144 |
12 | 1297a87aa7640 |
13 | 61a3c75c0655 |
14 | 2a059cd2c17a |
15 | 14121060a10c |
hex | a01292c44d0 |
11000102012112 has 40 divisors (see below), whose sum is σ = 28431061193440. Its totient is φ = 3664877316480.
The previous prime is 11000102011993. The next prime is 11000102012113. The reversal of 11000102012112 is 21121020100011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000102012113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56882287 + ... + 57075342.
It is an arithmetic number, because the mean of its divisors is an integer number (710776529836).
Almost surely, 211000102012112 is an apocalyptic number.
11000102012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11000102012112 is an abundant number, since it is smaller than the sum of its proper divisors (17430959181328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000102012112 is a wasteful number, since it uses less digits than its factorization.
11000102012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113959651 (or 113959645 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11000102012112 its reverse (21121020100011), we get a palindrome (32121122112123).
The spelling of 11000102012112 in words is "eleven trillion, one hundred two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •