Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …0111100110001010000100 |
3 | 1102221121011221220012110210 |
4 | 2200010221013212022010 |
5 | 2420211201340232322 |
6 | 35221213210315420 |
7 | 2213505521426055 |
oct | 240045107461204 |
9 | 42847157805423 |
10 | 11000101102212 |
11 | 3561131333562 |
12 | 1297a87728b70 |
13 | 61a3c7362451 |
14 | 2a059cb7272c |
15 | 1412104ca70c |
hex | a01291e6284 |
11000101102212 has 24 divisors (see below), whose sum is σ = 25710628146336. Its totient is φ = 3660453856768.
The previous prime is 11000101102183. The next prime is 11000101102213. The reversal of 11000101102212 is 21220110100011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (11000101102213) 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, 780806493 + ... + 780820580.
It is an arithmetic number, because the mean of its divisors is an integer number (1071276172764).
Almost surely, 211000101102212 is an apocalyptic number.
11000101102212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11000101102212 is an abundant number, since it is smaller than the sum of its proper divisors (14710527044124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000101102212 is a wasteful number, since it uses less digits than its factorization.
11000101102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1561627667 (or 1561627665 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11000101102212 its reverse (21220110100011), we get a palindrome (32220211202223).
The spelling of 11000101102212 in words is "eleven trillion, one hundred one million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •