Base | Representation |
---|---|
bin | 1011111010100100110… |
… | …11011001111100001101 |
3 | 1110010202010101011112002 |
4 | 11331102123121330031 |
5 | 23201430112341343 |
6 | 512024501522045 |
7 | 41402301313106 |
oct | 5752233317415 |
9 | 1403663334462 |
10 | 409404808973 |
11 | 14869a3835a6 |
12 | 67418a13325 |
13 | 2c7b6c24a74 |
14 | 15b5b2713ad |
15 | a9b23d88b8 |
hex | 5f526d9f0d |
409404808973 has 2 divisors, whose sum is σ = 409404808974. Its totient is φ = 409404808972.
The previous prime is 409404808933. The next prime is 409404809039. The reversal of 409404808973 is 379808404904.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 214625578729 + 194779230244 = 463277^2 + 441338^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-409404808973 is a prime.
It is a super-2 number, since 2×4094048089732 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (409404808933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 204702404486 + 204702404487.
It is an arithmetic number, because the mean of its divisors is an integer number (204702404487).
Almost surely, 2409404808973 is an apocalyptic number.
It is an amenable number.
409404808973 is a deficient number, since it is larger than the sum of its proper divisors (1).
409404808973 is an equidigital number, since it uses as much as digits as its factorization.
409404808973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6967296, while the sum is 56.
The spelling of 409404808973 in words is "four hundred nine billion, four hundred four million, eight hundred eight thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •