Base | Representation |
---|---|
bin | 11011000111101100… |
… | …010101001110001101 |
3 | 2210011102120220011200 |
4 | 123013230111032031 |
5 | 434114220403041 |
6 | 21213320340113 |
7 | 2050423455360 |
oct | 330754251615 |
9 | 83142526150 |
10 | 29120091021 |
11 | 1139359442a |
12 | 5788314639 |
13 | 2990cb43b8 |
14 | 15a363c0d7 |
15 | b5676a1b6 |
hex | 6c7b1538d |
29120091021 has 12 divisors (see below), whose sum is σ = 48071261472. Its totient is φ = 16640051976.
The previous prime is 29120090971. The next prime is 29120091031. The reversal of 29120091021 is 12019002192.
It is not a de Polignac number, because 29120091021 - 26 = 29120090957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29120091031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 231111771 + ... + 231111896.
It is an arithmetic number, because the mean of its divisors is an integer number (4005938456).
Almost surely, 229120091021 is an apocalyptic number.
29120091021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
29120091021 is a deficient number, since it is larger than the sum of its proper divisors (18951170451).
29120091021 is a wasteful number, since it uses less digits than its factorization.
29120091021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462223680 (or 462223677 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 29120091021 in words is "twenty-nine billion, one hundred twenty million, ninety-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •