Base | Representation |
---|---|
bin | 1100110001010101100111… |
… | …0100111111111100100001 |
3 | 1211201101020001121200000022 |
4 | 3030111121310333330201 |
5 | 3320030003310000012 |
6 | 45510405425003225 |
7 | 2646324532335023 |
oct | 314253164777441 |
9 | 54641201550008 |
10 | 14041755156257 |
11 | 4524090799594 |
12 | 16a9477483515 |
13 | 7ab1938250ba |
14 | 3678a5b9c013 |
15 | 1953d1a31472 |
hex | cc559d3ff21 |
14041755156257 has 2 divisors, whose sum is σ = 14041755156258. Its totient is φ = 14041755156256.
The previous prime is 14041755156251. The next prime is 14041755156263. The reversal of 14041755156257 is 75265155714041.
It is a balanced prime because it is at equal distance from previous prime (14041755156251) and next prime (14041755156263).
It can be written as a sum of positive squares in only one way, i.e., 10407695401216 + 3634059755041 = 3226096^2 + 1906321^2 .
It is a cyclic number.
It is not a de Polignac number, because 14041755156257 - 214 = 14041755139873 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14041755156199 and 14041755156208.
It is not a weakly prime, because it can be changed into another prime (14041755156251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7020877578128 + 7020877578129.
It is an arithmetic number, because the mean of its divisors is an integer number (7020877578129).
Almost surely, 214041755156257 is an apocalyptic number.
It is an amenable number.
14041755156257 is a deficient number, since it is larger than the sum of its proper divisors (1).
14041755156257 is an equidigital number, since it uses as much as digits as its factorization.
14041755156257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5880000, while the sum is 53.
The spelling of 14041755156257 in words is "fourteen trillion, forty-one billion, seven hundred fifty-five million, one hundred fifty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •