Base | Representation |
---|---|
bin | 11011101001101110… |
… | …110011110101100010 |
3 | 2211122020011111211200 |
4 | 123221232303311202 |
5 | 441301414303200 |
6 | 21350120422030 |
7 | 2100526514220 |
oct | 335156636542 |
9 | 84566144750 |
10 | 29691166050 |
11 | 11656986567 |
12 | 5907617916 |
13 | 2a523c3410 |
14 | 1619415b10 |
15 | b8b972800 |
hex | 6e9bb3d62 |
29691166050 has 576 divisors, whose sum is σ = 106766499840. Its totient is φ = 5738688000.
The previous prime is 29691166013. The next prime is 29691166051. The reversal of 29691166050 is 5066119692.
It is a happy number.
29691166050 is a `hidden beast` number, since 29 + 6 + 9 + 1 + 16 + 605 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 29691165987 and 29691166005.
It is not an unprimeable number, because it can be changed into a prime (29691166051) by changing a digit.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 24118935 + ... + 24120165.
Almost surely, 229691166050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29691166050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53383249920).
29691166050 is an abundant number, since it is smaller than the sum of its proper divisors (77075333790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29691166050 is a wasteful number, since it uses less digits than its factorization.
29691166050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319 (or 1311 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 45.
The spelling of 29691166050 in words is "twenty-nine billion, six hundred ninety-one million, one hundred sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •