Base | Representation |
---|---|
bin | 11011101000110010… |
… | …011111000010001000 |
3 | 2211121010102002022112 |
4 | 123220302133002020 |
5 | 441233342232300 |
6 | 21344353441452 |
7 | 2100245221544 |
oct | 335062370210 |
9 | 84533362275 |
10 | 29675352200 |
11 | 11648a6536a |
12 | 5902270288 |
13 | 2a4c047500 |
14 | 161729aa24 |
15 | b8a39be35 |
hex | 6e8c9f088 |
29675352200 has 108 divisors (see below), whose sum is σ = 74790591165. Its totient is φ = 10945359360.
The previous prime is 29675352199. The next prime is 29675352221. The reversal of 29675352200 is 225357692.
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 14 ways, for example, as 23239782916 + 6435569284 = 152446^2 + 80222^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=121810.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 31670132 + ... + 31671068.
Almost surely, 229675352200 is an apocalyptic number.
29675352200 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 29675352200
29675352200 is an abundant number, since it is smaller than the sum of its proper divisors (45115238965).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29675352200 is an equidigital number, since it uses as much as digits as its factorization.
29675352200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1916 (or 957 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 41.
The spelling of 29675352200 in words is "twenty-nine billion, six hundred seventy-five million, three hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •