Base | Representation |
---|---|
bin | 111000001011… |
… | …0001110000101 |
3 | 2001102021101000 |
4 | 1300112032011 |
5 | 30014414031 |
6 | 2531123513 |
7 | 505221246 |
oct | 160261605 |
9 | 61367330 |
10 | 29451141 |
11 | 15696095 |
12 | 9a43599 |
13 | 6142215 |
14 | 3ca8ccd |
15 | 28bb3e6 |
hex | 1c16385 |
29451141 has 8 divisors (see below), whose sum is σ = 43631360. Its totient is φ = 19634076.
The previous prime is 29451133. The next prime is 29451167. The reversal of 29451141 is 14115492.
It is not a de Polignac number, because 29451141 - 23 = 29451133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1090783 = 29451141 / (2 + 9 + 4 + 5 + 1 + 1 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29451101) 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, 545365 + ... + 545418.
It is an arithmetic number, because the mean of its divisors is an integer number (5453920).
Almost surely, 229451141 is an apocalyptic number.
It is an amenable number.
29451141 is a deficient number, since it is larger than the sum of its proper divisors (14180219).
29451141 is a wasteful number, since it uses less digits than its factorization.
29451141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090792 (or 1090786 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 29451141 is about 5426.8905461599. The cubic root of 29451141 is about 308.8166505839.
It can be divided in two parts, 29451 and 141, that added together give a palindrome (29592).
The spelling of 29451141 in words is "twenty-nine million, four hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •