Base | Representation |
---|---|
bin | 1011101001000101000… |
… | …01101100000010110011 |
3 | 1102020111110200011010012 |
4 | 11310202201230002303 |
5 | 23023210332340102 |
6 | 503432420325135 |
7 | 40620436140614 |
oct | 5644241540263 |
9 | 1366443604105 |
10 | 400011215027 |
11 | 1447099a2416 |
12 | 65636b437ab |
13 | 2b94aa66c58 |
14 | 15509881c0b |
15 | a6128b1752 |
hex | 5d2286c0b3 |
400011215027 has 2 divisors, whose sum is σ = 400011215028. Its totient is φ = 400011215026.
The previous prime is 400011214957. The next prime is 400011215063. The reversal of 400011215027 is 720512110004.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 400011215027 - 210 = 400011214003 is a prime.
It is a super-2 number, since 2×4000112150272 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 400011214993 and 400011215011.
It is not a weakly prime, because it can be changed into another prime (400011295027) 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, 200005607513 + 200005607514.
It is an arithmetic number, because the mean of its divisors is an integer number (200005607514).
Almost surely, 2400011215027 is an apocalyptic number.
400011215027 is a deficient number, since it is larger than the sum of its proper divisors (1).
400011215027 is an equidigital number, since it uses as much as digits as its factorization.
400011215027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
The spelling of 400011215027 in words is "four hundred billion, eleven million, two hundred fifteen thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •