Base | Representation |
---|---|
bin | 11011100000110010… |
… | …011011100000000000 |
3 | 2211020202211101100120 |
4 | 123200302123200000 |
5 | 441000011320000 |
6 | 21323200420240 |
7 | 2064025243200 |
oct | 334062334000 |
9 | 84222741316 |
10 | 29541120000 |
11 | 1158a212767 |
12 | 5885317680 |
13 | 2a2a2a9582 |
14 | 1603518400 |
15 | b7d6d46a0 |
hex | 6e0c9b800 |
29541120000 has 720 divisors, whose sum is σ = 115211776680. Its totient is φ = 6709248000.
The previous prime is 29541119957. The next prime is 29541120017. The reversal of 29541120000 is 2114592.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 188159922 + ... + 188160078.
Almost surely, 229541120000 is an apocalyptic number.
29541120000 is a gapful number since it is divisible by the number (20) 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 29541120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57605888340).
29541120000 is an abundant number, since it is smaller than the sum of its proper divisors (85670656680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29541120000 is an equidigital number, since it uses as much as digits as its factorization.
29541120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216 (or 174 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 29541120000 its reverse (2114592), we get a palindrome (29543234592).
The spelling of 29541120000 in words is "twenty-nine billion, five hundred forty-one million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •