Base | Representation |
---|---|
bin | 11000011000011… |
… | …110100001110001 |
3 | 1001111201220002221 |
4 | 120120132201301 |
5 | 1314210212211 |
6 | 104331441041 |
7 | 13065014656 |
oct | 3030364161 |
9 | 1044656087 |
10 | 409069681 |
11 | 19aa00119 |
12 | b4bb6181 |
13 | 66998887 |
14 | 3c485c2d |
15 | 25da5c71 |
hex | 1861e871 |
409069681 has 4 divisors (see below), whose sum is σ = 409567552. Its totient is φ = 408571812.
The previous prime is 409069643. The next prime is 409069699. The reversal of 409069681 is 186960904.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 409069681 - 213 = 409061489 is a prime.
It is a super-2 number, since 2×4090696812 = 334676007826883522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (409069631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 247701 + ... + 249346.
It is an arithmetic number, because the mean of its divisors is an integer number (102391888).
Almost surely, 2409069681 is an apocalyptic number.
It is an amenable number.
409069681 is a deficient number, since it is larger than the sum of its proper divisors (497871).
409069681 is an equidigital number, since it uses as much as digits as its factorization.
409069681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497870.
The product of its (nonzero) digits is 93312, while the sum is 43.
The square root of 409069681 is about 20225.4710946371. The cubic root of 409069681 is about 742.3335641796. Note that the first 3 decimals are identical.
The spelling of 409069681 in words is "four hundred nine million, sixty-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •