Base | Representation |
---|---|
bin | 11011000111001010… |
… | …110101101100000000 |
3 | 2210010211001211101120 |
4 | 123013022311230000 |
5 | 434104443423404 |
6 | 21212404232240 |
7 | 2050256030061 |
oct | 330712655400 |
9 | 83124054346 |
10 | 29111311104 |
11 | 113896379a7 |
12 | 578539b680 |
13 | 298c22bc95 |
14 | 15a23d4568 |
15 | b55ad39d9 |
hex | 6c72b5b00 |
29111311104 has 144 divisors (see below), whose sum is σ = 80537786112. Its totient is φ = 9326997504.
The previous prime is 29111311093. The next prime is 29111311109. The reversal of 29111311104 is 40111311192.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (29111311109) 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, 2352357 + ... + 2364699.
Almost surely, 229111311104 is an apocalyptic number.
29111311104 is a gapful number since it is divisible by the number (24) 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 29111311104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40268893056).
29111311104 is an abundant number, since it is smaller than the sum of its proper divisors (51426475008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29111311104 is a wasteful number, since it uses less digits than its factorization.
29111311104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12482 (or 12468 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 24.
Adding to 29111311104 its reverse (40111311192), we get a palindrome (69222622296).
The spelling of 29111311104 in words is "twenty-nine billion, one hundred eleven million, three hundred eleven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •