Base | Representation |
---|---|
bin | 11000011000101… |
… | …101011000000001 |
3 | 1001111211222112101 |
4 | 120120231120001 |
5 | 1314214133442 |
6 | 104333030401 |
7 | 13065360166 |
oct | 3030553001 |
9 | 1044758471 |
10 | 409130497 |
11 | 19aa41886 |
12 | b5025401 |
13 | 669ba469 |
14 | 3c4a006d |
15 | 25db8cb7 |
hex | 1862d601 |
409130497 has 8 divisors (see below), whose sum is σ = 424352232. Its totient is φ = 394128000.
The previous prime is 409130473. The next prime is 409130503. The reversal of 409130497 is 794031904.
It can be written as a sum of positive squares in 4 ways, for example, as 176384961 + 232745536 = 13281^2 + 15256^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 409130497 - 27 = 409130369 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (409130437) 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, 51004 + ... + 58477.
It is an arithmetic number, because the mean of its divisors is an integer number (53044029).
Almost surely, 2409130497 is an apocalyptic number.
It is an amenable number.
409130497 is a deficient number, since it is larger than the sum of its proper divisors (15221735).
409130497 is a wasteful number, since it uses less digits than its factorization.
409130497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109619.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 409130497 is about 20226.9744895276. The cubic root of 409130497 is about 742.3703496981.
The spelling of 409130497 in words is "four hundred nine million, one hundred thirty thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •