Base | Representation |
---|---|
bin | 1100110001011110110110… |
… | …1001010110111000100001 |
3 | 1211201121121220010111210101 |
4 | 3030113231221112320201 |
5 | 3320100043143214244 |
6 | 45511455455302401 |
7 | 2646443144645224 |
oct | 314275551267041 |
9 | 54647556114711 |
10 | 14044235132449 |
11 | 4525143666395 |
12 | 16a9a49b1aa01 |
13 | 7ab49a563332 |
14 | 367a5d2b95bb |
15 | 1954c96040d4 |
hex | cc5eda56e21 |
14044235132449 has 2 divisors, whose sum is σ = 14044235132450. Its totient is φ = 14044235132448.
The previous prime is 14044235132429. The next prime is 14044235132471. The reversal of 14044235132449 is 94423153244041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13925025140625 + 119209991824 = 3731625^2 + 345268^2 .
It is a cyclic number.
It is not a de Polignac number, because 14044235132449 - 27 = 14044235132321 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14044235132399 and 14044235132408.
It is not a weakly prime, because it can be changed into another prime (14044235132429) 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, 7022117566224 + 7022117566225.
It is an arithmetic number, because the mean of its divisors is an integer number (7022117566225).
Almost surely, 214044235132449 is an apocalyptic number.
It is an amenable number.
14044235132449 is a deficient number, since it is larger than the sum of its proper divisors (1).
14044235132449 is an equidigital number, since it uses as much as digits as its factorization.
14044235132449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1658880, while the sum is 46.
The spelling of 14044235132449 in words is "fourteen trillion, forty-four billion, two hundred thirty-five million, one hundred thirty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •