Base | Representation |
---|---|
bin | 1100110101111100010010… |
… | …0000100100000100101001 |
3 | 1211222221101121202012012102 |
4 | 3031133010200210010221 |
5 | 3322324002204411044 |
6 | 50011010403423145 |
7 | 2655124635515243 |
oct | 315370440440451 |
9 | 54887347665172 |
10 | 14120854372649 |
11 | 4554691188602 |
12 | 1700871684ab5 |
13 | 7b578b14a95b |
14 | 36b64b055093 |
15 | 1974b0dbb24e |
hex | cd7c4824129 |
14120854372649 has 2 divisors, whose sum is σ = 14120854372650. Its totient is φ = 14120854372648.
The previous prime is 14120854372609. The next prime is 14120854372693. The reversal of 14120854372649 is 94627345802141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7375759747225 + 6745094625424 = 2715835^2 + 2597132^2 .
It is a cyclic number.
It is not a de Polignac number, because 14120854372649 - 236 = 14052134895913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14120854372594 and 14120854372603.
It is not a weakly prime, because it can be changed into another prime (14120854372609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7060427186324 + 7060427186325.
It is an arithmetic number, because the mean of its divisors is an integer number (7060427186325).
It is a 1-persistent number, because it is pandigital, but 2⋅14120854372649 = 28241708745298 is not.
Almost surely, 214120854372649 is an apocalyptic number.
It is an amenable number.
14120854372649 is a deficient number, since it is larger than the sum of its proper divisors (1).
14120854372649 is an equidigital number, since it uses as much as digits as its factorization.
14120854372649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 14120854372649 in words is "fourteen trillion, one hundred twenty billion, eight hundred fifty-four million, three hundred seventy-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •