Base | Representation |
---|---|
bin | 110111111000… |
… | …1011101011000 |
3 | 2001010121211020 |
4 | 1233301131120 |
5 | 30000104233 |
6 | 2524002440 |
7 | 504023253 |
oct | 157613530 |
9 | 61117736 |
10 | 29300568 |
11 | 155a2a50 |
12 | 9990420 |
13 | 60bb81b |
14 | 3c6a09a |
15 | 288b9b3 |
hex | 1bf1758 |
29300568 has 64 divisors (see below), whose sum is σ = 81889920. Its totient is φ = 8659200.
The previous prime is 29300563. The next prime is 29300581. The reversal of 29300568 is 86500392.
It is a happy number.
It is a Cunningham number, because it is equal to 54132-1.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29300563) 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, 9471 + ... + 12177.
It is an arithmetic number, because the mean of its divisors is an integer number (1279530).
Almost surely, 229300568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29300568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40944960).
29300568 is an abundant number, since it is smaller than the sum of its proper divisors (52589352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29300568 is a wasteful number, since it uses less digits than its factorization.
29300568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2768 (or 2764 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 29300568 is about 5412.9999076298. Note that the first 4 decimals coincide. The cubic root of 29300568 is about 308.2894619505.
The spelling of 29300568 in words is "twenty-nine million, three hundred thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •