Base | Representation |
---|---|
bin | 1100111110000011010000… |
… | …1010001011001110001001 |
3 | 1212111020222112002210102002 |
4 | 3033200310022023032021 |
5 | 3332114310111132403 |
6 | 50155010254120345 |
7 | 3001156135224446 |
oct | 317406412131611 |
9 | 55436875083362 |
10 | 14260166505353 |
11 | 45a878025987a |
12 | 1723870ab00b5 |
13 | 7c596035aa82 |
14 | 3742a51869cd |
15 | 19ae16515188 |
hex | cf83428b389 |
14260166505353 has 2 divisors, whose sum is σ = 14260166505354. Its totient is φ = 14260166505352.
The previous prime is 14260166505307. The next prime is 14260166505359. The reversal of 14260166505353 is 35350566106241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12866626392064 + 1393540113289 = 3587008^2 + 1180483^2 .
It is a cyclic number.
It is not a de Polignac number, because 14260166505353 - 28 = 14260166505097 is a prime.
It is a super-3 number, since 3×142601665053533 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14260166505298 and 14260166505307.
It is not a weakly prime, because it can be changed into another prime (14260166505359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7130083252676 + 7130083252677.
It is an arithmetic number, because the mean of its divisors is an integer number (7130083252677).
Almost surely, 214260166505353 is an apocalyptic number.
It is an amenable number.
14260166505353 is a deficient number, since it is larger than the sum of its proper divisors (1).
14260166505353 is an equidigital number, since it uses as much as digits as its factorization.
14260166505353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944000, while the sum is 47.
The spelling of 14260166505353 in words is "fourteen trillion, two hundred sixty billion, one hundred sixty-six million, five hundred five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •