Base | Representation |
---|---|
bin | 10100110011111000… |
… | …11111001111001100 |
3 | 1001211122102020021100 |
4 | 22121330133033030 |
5 | 140340203031403 |
6 | 5044353503100 |
7 | 543604266426 |
oct | 123174371714 |
9 | 31748366240 |
10 | 11172705228 |
11 | 4813778893 |
12 | 21b9871a90 |
13 | 10909460a9 |
14 | 77dbc9816 |
15 | 455d062a3 |
hex | 299f1f3cc |
11172705228 has 36 divisors (see below), whose sum is σ = 28274920128. Its totient is φ = 3719909280.
The previous prime is 11172705149. The next prime is 11172705233. The reversal of 11172705228 is 82250727111.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×111727052282 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 11172705192 and 11172705201.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 148743 + ... + 210878.
It is an arithmetic number, because the mean of its divisors is an integer number (785414448).
Almost surely, 211172705228 is an apocalyptic number.
11172705228 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11172705228 is an abundant number, since it is smaller than the sum of its proper divisors (17102214900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11172705228 is a wasteful number, since it uses less digits than its factorization.
11172705228 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 360494 (or 360489 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 36.
The spelling of 11172705228 in words is "eleven billion, one hundred seventy-two million, seven hundred five thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •