Base | Representation |
---|---|
bin | 1100111010110010000111… |
… | …0111111000010001011001 |
3 | 1212021220001221020011100111 |
4 | 3032230201313320101121 |
5 | 3330204320414110114 |
6 | 50113123350004321 |
7 | 2664130661434342 |
oct | 316544167702131 |
9 | 55256057204314 |
10 | 14204025144409 |
11 | 4586990994411 |
12 | 1714a033466a1 |
13 | 7c0584159679 |
14 | 37169ad6b0c9 |
15 | 19972c912bc4 |
hex | ceb21df8459 |
14204025144409 has 2 divisors, whose sum is σ = 14204025144410. Its totient is φ = 14204025144408.
The previous prime is 14204025144401. The next prime is 14204025144431. The reversal of 14204025144409 is 90444152040241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9860981648400 + 4343043496009 = 3140220^2 + 2083997^2 .
It is a cyclic number.
It is not a de Polignac number, because 14204025144409 - 23 = 14204025144401 is a prime.
It is a super-2 number, since 2×142040251444092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14204025144401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7102012572204 + 7102012572205.
It is an arithmetic number, because the mean of its divisors is an integer number (7102012572205).
Almost surely, 214204025144409 is an apocalyptic number.
It is an amenable number.
14204025144409 is a deficient number, since it is larger than the sum of its proper divisors (1).
14204025144409 is an equidigital number, since it uses as much as digits as its factorization.
14204025144409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 40.
The spelling of 14204025144409 in words is "fourteen trillion, two hundred four billion, twenty-five million, one hundred forty-four thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •