Base | Representation |
---|---|
bin | 1100110100001000001… |
… | …0101100100011001001 |
3 | 210001020201120120111100 |
4 | 3031002002230203021 |
5 | 12101332220210423 |
6 | 245045223052013 |
7 | 21622361321103 |
oct | 3150202544311 |
9 | 701221516440 |
10 | 220151335113 |
11 | 85402764566 |
12 | 368002a1009 |
13 | 179b61725c8 |
14 | a92651c573 |
15 | 5ad7635343 |
hex | 33420ac8c9 |
220151335113 has 12 divisors (see below), whose sum is σ = 325391638000. Its totient is φ = 143354357496.
The previous prime is 220151335067. The next prime is 220151335127. The reversal of 220151335113 is 311533151022.
220151335113 is a `hidden beast` number, since 2 + 2 + 0 + 1 + 513 + 35 + 113 = 666.
It is not a de Polignac number, because 220151335113 - 237 = 82712381641 is a prime.
It is a super-2 number, since 2×2201513351132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220151335213) 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, 284432863 + ... + 284433636.
Almost surely, 2220151335113 is an apocalyptic number.
It is an amenable number.
220151335113 is a deficient number, since it is larger than the sum of its proper divisors (105240302887).
220151335113 is a wasteful number, since it uses less digits than its factorization.
220151335113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568866548 (or 568866545 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 220151335113 its reverse (311533151022), we get a palindrome (531684486135).
It can be divided in two parts, 22015 and 1335113, that added together give a triangular number (1357128 = T1647).
The spelling of 220151335113 in words is "two hundred twenty billion, one hundred fifty-one million, three hundred thirty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •