Base | Representation |
---|---|
bin | 11011000010100000… |
… | …010001001000001001 |
3 | 2202221100210100222012 |
4 | 123002200101020021 |
5 | 433424424324231 |
6 | 21200530505305 |
7 | 2045315534414 |
oct | 330240211011 |
9 | 82840710865 |
10 | 29033042441 |
11 | 11349439557 |
12 | 5763135235 |
13 | 2978c56970 |
14 | 1595c5cb7b |
15 | b4dcc2e2b |
hex | 6c2811209 |
29033042441 has 8 divisors (see below), whose sum is σ = 31274472264. Its totient is φ = 26792772480.
The previous prime is 29033042431. The next prime is 29033042443. The reversal of 29033042441 is 14424033092.
It can be written as a sum of positive squares in 4 ways, for example, as 1883560000 + 27149482441 = 43400^2 + 164771^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 29033042441 - 210 = 29033041417 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 29033042398 and 29033042407.
It is not an unprimeable number, because it can be changed into a prime (29033042443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 237620 + ... + 338421.
It is an arithmetic number, because the mean of its divisors is an integer number (3909309033).
Almost surely, 229033042441 is an apocalyptic number.
It is an amenable number.
29033042441 is a deficient number, since it is larger than the sum of its proper divisors (2241429823).
29033042441 is a wasteful number, since it uses less digits than its factorization.
29033042441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579931.
The product of its (nonzero) digits is 20736, while the sum is 32.
The spelling of 29033042441 in words is "twenty-nine billion, thirty-three million, forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •