Base | Representation |
---|---|
bin | 10100100000011001… |
… | …01001011101000000 |
3 | 1001102020200202001000 |
4 | 22100030221131000 |
5 | 140021321403331 |
6 | 5020232412000 |
7 | 536550252153 |
oct | 122014513500 |
9 | 31366622030 |
10 | 11009169216 |
11 | 473a430861 |
12 | 2172b47000 |
13 | 1065ab8016 |
14 | 7661b9c9a |
15 | 4467a10e6 |
hex | 290329740 |
11009169216 has 112 divisors (see below), whose sum is σ = 32393737600. Its totient is φ = 3666456576.
The previous prime is 11009169211. The next prime is 11009169271. The reversal of 11009169216 is 61296190011.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11009169211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2664240 + ... + 2668368.
It is an arithmetic number, because the mean of its divisors is an integer number (289229800).
Almost surely, 211009169216 is an apocalyptic number.
11009169216 is a gapful number since it is divisible by the number (16) 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 11009169216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16196868800).
11009169216 is an abundant number, since it is smaller than the sum of its proper divisors (21384568384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11009169216 is a wasteful number, since it uses less digits than its factorization.
11009169216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5693 (or 5677 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 36.
The spelling of 11009169216 in words is "eleven billion, nine million, one hundred sixty-nine thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •