Base | Representation |
---|---|
bin | 1101011010110000111111… |
… | …00001001101011011100000 |
3 | 10212110211121100220002120211 |
4 | 12231120133201031123200 |
5 | 12331420220223413401 |
6 | 142431150234543504 |
7 | 6133543554522541 |
oct | 655303741153340 |
9 | 125424540802524 |
10 | 29506954122976 |
11 | 94469133a3130 |
12 | 338678b297b94 |
13 | 1360655c53855 |
14 | 7402039804c8 |
15 | 36282494b951 |
hex | 1ad61f84d6e0 |
29506954122976 has 48 divisors (see below), whose sum is σ = 63375597427968. Its totient is φ = 13411678896000.
The previous prime is 29506954122967. The next prime is 29506954122977. The reversal of 29506954122976 is 67922145960592.
It is a super-3 number, since 3×295069541229763 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29506954122977) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6515401 + ... + 10072951.
It is an arithmetic number, because the mean of its divisors is an integer number (1320324946416).
Almost surely, 229506954122976 is an apocalyptic number.
It is an amenable number.
29506954122976 is an abundant number, since it is smaller than the sum of its proper divisors (33868643304992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29506954122976 is a wasteful number, since it uses less digits than its factorization.
29506954122976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3581135 (or 3581127 counting only the distinct ones).
The product of its (nonzero) digits is 146966400, while the sum is 67.
The spelling of 29506954122976 in words is "twenty-nine trillion, five hundred six billion, nine hundred fifty-four million, one hundred twenty-two thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •