Base | Representation |
---|---|
bin | 1010000110001011001100… |
… | …1101010011011100001100 |
3 | 1110022021010212021010112110 |
4 | 2201202303031103130030 |
5 | 2423340230214231103 |
6 | 35335453303504020 |
7 | 2224015064643423 |
oct | 241426315233414 |
9 | 43267125233473 |
10 | 11101202102028 |
11 | 359aaa21a7065 |
12 | 12b35a2158010 |
13 | 626ab9cb296c |
14 | 2a54301122ba |
15 | 143b7b1e7403 |
hex | a18b335370c |
11101202102028 has 96 divisors (see below), whose sum is σ = 27084630311424. Its totient is φ = 3535710248448.
The previous prime is 11101202102027. The next prime is 11101202102063. The reversal of 11101202102028 is 82020120210111.
It is a super-2 number, since 2×111012021020282 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11101202101995 and 11101202102013.
It is not an unprimeable number, because it can be changed into a prime (11101202102027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5252376 + ... + 7056192.
It is an arithmetic number, because the mean of its divisors is an integer number (282131565744).
Almost surely, 211101202102028 is an apocalyptic number.
It is an amenable number.
11101202102028 is an abundant number, since it is smaller than the sum of its proper divisors (15983428209396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101202102028 is a wasteful number, since it uses less digits than its factorization.
11101202102028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1804111 (or 1804109 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 11101202102028 its reverse (82020120210111), we get a palindrome (93121322312139).
The spelling of 11101202102028 in words is "eleven trillion, one hundred one billion, two hundred two million, one hundred two thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •