Base | Representation |
---|---|
bin | 1100000011001100100… |
… | …00011010101100101101 |
3 | 1110120200122002012000212 |
4 | 12001212100122230231 |
5 | 23240414301040414 |
6 | 514112012032205 |
7 | 41625052450061 |
oct | 6014620325455 |
9 | 1416618065025 |
10 | 414032440109 |
11 | 14a654578342 |
12 | 682aa762665 |
13 | 30073897a42 |
14 | 16079ac1aa1 |
15 | ab837d883e |
hex | 606641ab2d |
414032440109 has 2 divisors, whose sum is σ = 414032440110. Its totient is φ = 414032440108.
The previous prime is 414032440067. The next prime is 414032440117. The reversal of 414032440109 is 901044230414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 288895500100 + 125136940009 = 537490^2 + 353747^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414032440109 is a prime.
It is a super-2 number, since 2×4140324401092 (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 (414032440009) 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, 207016220054 + 207016220055.
It is an arithmetic number, because the mean of its divisors is an integer number (207016220055).
Almost surely, 2414032440109 is an apocalyptic number.
It is an amenable number.
414032440109 is a deficient number, since it is larger than the sum of its proper divisors (1).
414032440109 is an equidigital number, since it uses as much as digits as its factorization.
414032440109 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 32.
The spelling of 414032440109 in words is "four hundred fourteen billion, thirty-two million, four hundred forty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •