Base | Representation |
---|---|
bin | 11011000001010001… |
… | …001011001110100100 |
3 | 2202212220202222220021 |
4 | 123001101023032210 |
5 | 433404122341100 |
6 | 21154510244524 |
7 | 2044644361651 |
oct | 330121131644 |
9 | 82786688807 |
10 | 29012308900 |
11 | 113387680a3 |
12 | 57581b6744 |
13 | 29748776b3 |
14 | 15931c2c28 |
15 | b4c079a1a |
hex | 6c144b3a4 |
29012308900 has 27 divisors (see below), whose sum is σ = 62960406691. Its totient is φ = 11604242240.
The previous prime is 29012308841. The next prime is 29012308901. The reversal of 29012308900 is 980321092.
The square root of 29012308900 is 170330.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 5145766756 + 23866542144 = 71734^2 + 154488^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (29012308901) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1694784 + ... + 1711816.
Almost surely, 229012308900 is an apocalyptic number.
29012308900 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
29012308900 is the 170330-th square number.
It is an amenable number.
29012308900 is an abundant number, since it is smaller than the sum of its proper divisors (33948097791).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29012308900 is an frugal number, since it uses more digits than its factorization.
29012308900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34080 (or 17040 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 34.
Adding to 29012308900 its reverse (980321092), we get a palindrome (29992629992).
The spelling of 29012308900 in words is "twenty-nine billion, twelve million, three hundred eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •