Base | Representation |
---|---|
bin | 10100111111001110… |
… | …10010011100000000 |
3 | 1002002021101002222000 |
4 | 22133213102130000 |
5 | 141034024423242 |
6 | 5102032144000 |
7 | 546140546100 |
oct | 123747223400 |
9 | 32067332860 |
10 | 11267811072 |
11 | 4862427261 |
12 | 2225698000 |
13 | 10a756503b |
14 | 78c6a5200 |
15 | 45e340a4c |
hex | 29f9d2700 |
11267811072 has 864 divisors, whose sum is σ = 43620595200. Its totient is φ = 2842656768.
The previous prime is 11267811047. The next prime is 11267811109. The reversal of 11267811072 is 27011876211.
It is a tau number, because it is divible by the number of its divisors (864).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 109396173 + ... + 109396275.
It is an arithmetic number, because the mean of its divisors is an integer number (50486800).
Almost surely, 211267811072 is an apocalyptic number.
11267811072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11267811072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21810297600).
11267811072 is an abundant number, since it is smaller than the sum of its proper divisors (32352784128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11267811072 is a wasteful number, since it uses less digits than its factorization.
11267811072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178 (or 151 counting only the distinct ones).
The product of its (nonzero) digits is 9408, while the sum is 36.
The spelling of 11267811072 in words is "eleven billion, two hundred sixty-seven million, eight hundred eleven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •