Base | Representation |
---|---|
bin | 11011110011011011… |
… | …110010000000000000 |
3 | 2212001120110210101002 |
4 | 123303123302000000 |
5 | 442120102344302 |
6 | 21414213431132 |
7 | 2104544246651 |
oct | 336333620000 |
9 | 85046423332 |
10 | 29853949952 |
11 | 1172a85a512 |
12 | 595203b4a8 |
13 | 2a7a04a058 |
14 | 1632cab528 |
15 | b9adc9c02 |
hex | 6f36f2000 |
29853949952 has 126 divisors (see below), whose sum is σ = 63173978427. Its totient is φ = 14105952256.
The previous prime is 29853949927. The next prime is 29853949969. The reversal of 29853949952 is 25994935892.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 14926974976 + 14926974976 = 122176^2 + 122176^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=122176.
It is a Duffinian number.
Its product of digits (62985600) is a multiple of the sum of its prime divisors (108).
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 359686103 + ... + 359686185.
Almost surely, 229853949952 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 29853949952
29853949952 is an abundant number, since it is smaller than the sum of its proper divisors (33320028475).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29853949952 is an frugal number, since it uses more digits than its factorization.
29853949952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238 (or 108 counting only the distinct ones).
The product of its digits is 62985600, while the sum is 65.
The spelling of 29853949952 in words is "twenty-nine billion, eight hundred fifty-three million, nine hundred forty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •