Base | Representation |
---|---|
bin | 1101100110010110001000… |
… | …01001100111111101111001 |
3 | 10220212212122122011002202211 |
4 | 12303023010021213331321 |
5 | 12404430114403001324 |
6 | 143334033324255121 |
7 | 6204361065606400 |
oct | 663130411477571 |
9 | 126785578132684 |
10 | 29904853172089 |
11 | 958a638aa7a85 |
12 | 342b9169a14a1 |
13 | 138c02823028c |
14 | 75558caca637 |
15 | 36cd61b91294 |
hex | 1b32c4267f79 |
29904853172089 has 27 divisors (see below), whose sum is σ = 35389559262351. Its totient is φ = 25196375168160.
The previous prime is 29904853172041. The next prime is 29904853172123. The reversal of 29904853172089 is 98027135840992.
The square root of 29904853172089 is 5468533.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 29760483570489 + 144369601600 = 5455317^2 + 379960^2 .
It is not a de Polignac number, because 29904853172089 - 27 = 29904853171961 is a prime.
It is not an unprimeable number, because it can be changed into a prime (29904853172489) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2258497509 + ... + 2258510749.
Almost surely, 229904853172089 is an apocalyptic number.
29904853172089 is the 5468533-rd square number.
29904853172089 is the 2734267-th centered octagonal number.
It is an amenable number.
29904853172089 is a deficient number, since it is larger than the sum of its proper divisors (5484706090262).
29904853172089 is an frugal number, since it uses more digits than its factorization.
29904853172089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26614 (or 13307 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 67.
The spelling of 29904853172089 in words is "twenty-nine trillion, nine hundred four billion, eight hundred fifty-three million, one hundred seventy-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •