Base | Representation |
---|---|
bin | 1100110001010100010111… |
… | …0110111001101001001001 |
3 | 1211201100100201011120111211 |
4 | 3030111011312321221021 |
5 | 3320023312022013114 |
6 | 45510312255453121 |
7 | 2646313323442666 |
oct | 314250566715111 |
9 | 54640321146454 |
10 | 14041420110409 |
11 | 4523a2965869a |
12 | 16a93a32271a1 |
13 | 7ab13c2a6713 |
14 | 3678734a4a6d |
15 | 1953b23ed6c4 |
hex | cc545db9a49 |
14041420110409 has 2 divisors, whose sum is σ = 14041420110410. Its totient is φ = 14041420110408.
The previous prime is 14041420110391. The next prime is 14041420110413. The reversal of 14041420110409 is 90401102414041.
14041420110409 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13681654072384 + 359766038025 = 3698872^2 + 599805^2 .
It is a cyclic number.
It is not a de Polignac number, because 14041420110409 - 211 = 14041420108361 is a prime.
It is a super-2 number, since 2×140414201104092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14041420110439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7020710055204 + 7020710055205.
It is an arithmetic number, because the mean of its divisors is an integer number (7020710055205).
Almost surely, 214041420110409 is an apocalyptic number.
It is an amenable number.
14041420110409 is a deficient number, since it is larger than the sum of its proper divisors (1).
14041420110409 is an equidigital number, since it uses as much as digits as its factorization.
14041420110409 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 31.
The spelling of 14041420110409 in words is "fourteen trillion, forty-one billion, four hundred twenty million, one hundred ten thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •