Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …1111011110100100010010 |
3 | 1102221121110200222120200000 |
4 | 2200010233233132210102 |
5 | 2420211413312021203 |
6 | 35221232220110430 |
7 | 2213511341055126 |
oct | 240045757364422 |
9 | 42847420876600 |
10 | 11000212220178 |
11 | 3561189029095 |
12 | 1297ab8995416 |
13 | 61a41439961c |
14 | 2a05ad819586 |
15 | 14121a1294a3 |
hex | a012fbde912 |
11000212220178 has 24 divisors (see below), whose sum is σ = 24716526224208. Its totient is φ = 3666737406564.
The previous prime is 11000212220177. The next prime is 11000212220227. The reversal of 11000212220178 is 87102221200011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (11000212220177) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11317090276 + ... + 11317091247.
It is an arithmetic number, because the mean of its divisors is an integer number (1029855259342).
Almost surely, 211000212220178 is an apocalyptic number.
11000212220178 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11000212220178 is an abundant number, since it is smaller than the sum of its proper divisors (13716314004030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000212220178 is an equidigital number, since it uses as much as digits as its factorization.
11000212220178 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22634181540 (or 22634181528 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 27.
Adding to 11000212220178 its reverse (87102221200011), we get a palindrome (98102433420189).
The spelling of 11000212220178 in words is "eleven trillion, two hundred twelve million, two hundred twenty thousand, one hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •