Base | Representation |
---|---|
bin | 10100111001101001… |
… | …11110110100110000 |
3 | 1001222000102101001000 |
4 | 22130310332310300 |
5 | 140440043202404 |
6 | 5053242242000 |
7 | 545032341120 |
oct | 123464766460 |
9 | 31860371030 |
10 | 11221069104 |
11 | 4839001333 |
12 | 2211ab6300 |
13 | 109a97a87b |
14 | 7863b8c80 |
15 | 45a1ab339 |
hex | 29cd3ed30 |
11221069104 has 160 divisors (see below), whose sum is σ = 36908352000. Its totient is φ = 3197442816.
The previous prime is 11221069103. The next prime is 11221069109. The reversal of 11221069104 is 40196012211.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (11221069103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1171567 + ... + 1181105.
It is an arithmetic number, because the mean of its divisors is an integer number (230677200).
Almost surely, 211221069104 is an apocalyptic number.
11221069104 is a gapful number since it is divisible by the number (14) 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 11221069104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18454176000).
11221069104 is an abundant number, since it is smaller than the sum of its proper divisors (25687282896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221069104 is a wasteful number, since it uses less digits than its factorization.
11221069104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9952 (or 9940 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The spelling of 11221069104 in words is "eleven billion, two hundred twenty-one million, sixty-nine thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •