Base | Representation |
---|---|
bin | 10111110111100… |
… | …100101010100101 |
3 | 1000220111122222211 |
4 | 113313210222211 |
5 | 1310003202234 |
6 | 103422523421 |
7 | 12631501264 |
oct | 2767445245 |
9 | 1026448884 |
10 | 400444069 |
11 | 196049613 |
12 | b2136571 |
13 | 64c6876c |
14 | 3b27c5db |
15 | 25250164 |
hex | 17de4aa5 |
400444069 has 2 divisors, whose sum is σ = 400444070. Its totient is φ = 400444068.
The previous prime is 400444049. The next prime is 400444087. The reversal of 400444069 is 960444004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 358647844 + 41796225 = 18938^2 + 6465^2 .
It is a cyclic number.
It is not a de Polignac number, because 400444069 - 221 = 398346917 is a prime.
It is a super-2 number, since 2×4004440692 = 320710904794553522, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 400444069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (400444039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200222034 + 200222035.
It is an arithmetic number, because the mean of its divisors is an integer number (200222035).
Almost surely, 2400444069 is an apocalyptic number.
It is an amenable number.
400444069 is a deficient number, since it is larger than the sum of its proper divisors (1).
400444069 is an equidigital number, since it uses as much as digits as its factorization.
400444069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
The square root of 400444069 is about 20011.0986455017. The cubic root of 400444069 is about 737.0788595874.
The spelling of 400444069 in words is "four hundred million, four hundred forty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •