Base | Representation |
---|---|
bin | 1010000110101100011001… |
… | …0001111000000010101100 |
3 | 1110100010010210210221211212 |
4 | 2201223012101320002230 |
5 | 2424012002133032340 |
6 | 35343525345533552 |
7 | 2224451634565010 |
oct | 241530621700254 |
9 | 43303123727755 |
10 | 11110112002220 |
11 | 35a3854648a40 |
12 | 12b526a0442b8 |
13 | 6278a9ba775a |
14 | 2a5a37592540 |
15 | 143eed527a65 |
hex | a1ac64780ac |
11110112002220 has 96 divisors (see below), whose sum is σ = 29090406998016. Its totient is φ = 3462640416000.
The previous prime is 11110112002217. The next prime is 11110112002291. The reversal of 11110112002220 is 2220021101111.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 11110112002195 and 11110112002204.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21525170 + ... + 22035270.
It is an arithmetic number, because the mean of its divisors is an integer number (303025072896).
Almost surely, 211110112002220 is an apocalyptic number.
11110112002220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110112002220 is an abundant number, since it is smaller than the sum of its proper divisors (17980294995796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110112002220 is a wasteful number, since it uses less digits than its factorization.
11110112002220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524271 (or 524269 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11110112002220 its reverse (2220021101111), we get a palindrome (13330133103331).
The spelling of 11110112002220 in words is "eleven trillion, one hundred ten billion, one hundred twelve million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •