Base | Representation |
---|---|
bin | 10100110011101100… |
… | …00010110110001000 |
3 | 1001211112020102012000 |
4 | 22121312002312020 |
5 | 140334240003242 |
6 | 5044253351000 |
7 | 543554032656 |
oct | 123166026610 |
9 | 31745212160 |
10 | 11171016072 |
11 | 4812824797 |
12 | 21b9198460 |
13 | 10904a42a8 |
14 | 77d8a9dd6 |
15 | 455ac0a4c |
hex | 299d82d88 |
11171016072 has 64 divisors (see below), whose sum is σ = 31039281600. Its totient is φ = 3722630400.
The previous prime is 11171016049. The next prime is 11171016107. The reversal of 11171016072 is 27061017111.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1389408 + ... + 1397424.
It is an arithmetic number, because the mean of its divisors is an integer number (484988775).
Almost surely, 211171016072 is an apocalyptic number.
11171016072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11171016072 is an abundant number, since it is smaller than the sum of its proper divisors (19868265528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11171016072 is a wasteful number, since it uses less digits than its factorization.
11171016072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14483 (or 14473 counting only the distinct ones).
The product of its (nonzero) digits is 588, while the sum is 27.
The spelling of 11171016072 in words is "eleven billion, one hundred seventy-one million, sixteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •