Base | Representation |
---|---|
bin | 11011000100100001… |
… | …110111011101110010 |
3 | 2210000201201102000000 |
4 | 123010201313131302 |
5 | 434012124003200 |
6 | 21204143010430 |
7 | 2046210363012 |
oct | 330441673562 |
9 | 83021642000 |
10 | 29067016050 |
11 | 11366633416 |
12 | 5772599a16 |
13 | 2982cc04a7 |
14 | 159a583c42 |
15 | b51c84300 |
hex | 6c4877772 |
29067016050 has 378 divisors, whose sum is σ = 87409703133. Its totient is φ = 7187006880.
The previous prime is 29067016037. The next prime is 29067016063. The reversal of 29067016050 is 5061076092.
It is an interprime number because it is at equal distance from previous prime (29067016037) and next prime (29067016063).
It can be written as a sum of positive squares in 2 ways, for example, as 28485675729 + 581340321 = 168777^2 + 24111^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=120555.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 29067015996 and 29067016014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 188 ways as a sum of consecutive naturals, for example, 618447127 + ... + 618447173.
Almost surely, 229067016050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29067016050
29067016050 is an abundant number, since it is smaller than the sum of its proper divisors (58342687083).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29067016050 is an equidigital number, since it uses as much as digits as its factorization.
29067016050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162 (or 76 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The spelling of 29067016050 in words is "twenty-nine billion, sixty-seven million, sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •