Base | Representation |
---|---|
bin | 1101011101011000110101… |
… | …00011011010000101010110 |
3 | 10212210110012100122100112210 |
4 | 12232230122203122011112 |
5 | 12334404242133014410 |
6 | 142540412022254250 |
7 | 6143213602440000 |
oct | 656543243320526 |
9 | 125713170570483 |
10 | 29597065126230 |
11 | 9481054740648 |
12 | 33a0139287386 |
13 | 1368cb6a6ca14 |
14 | 7447114d5370 |
15 | 364d4a903220 |
hex | 1aeb1a8da156 |
29597065126230 has 640 divisors, whose sum is σ = 87376210661376. Its totient is φ = 6407604403200.
The previous prime is 29597065126159. The next prime is 29597065126247. The reversal of 29597065126230 is 3262156079592.
It is a hoax number, since the sum of its digits (57) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 27078741564 + ... + 27078742656.
Almost surely, 229597065126230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29597065126230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43688105330688).
29597065126230 is an abundant number, since it is smaller than the sum of its proper divisors (57779145535146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29597065126230 is a wasteful number, since it uses less digits than its factorization.
29597065126230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1410 (or 1389 counting only the distinct ones).
The product of its (nonzero) digits is 12247200, while the sum is 57.
The spelling of 29597065126230 in words is "twenty-nine trillion, five hundred ninety-seven billion, sixty-five million, one hundred twenty-six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •