Base | Representation |
---|---|
bin | 1100111111010100000110… |
… | …1110010001000000000001 |
3 | 1212120100000000000000000001 |
4 | 3033311001232101000001 |
5 | 3332443231420001442 |
6 | 50213000000000001 |
7 | 3002555011464133 |
oct | 317650156210001 |
9 | 55510000000001 |
10 | 14281868906497 |
11 | 46069a7740a95 |
12 | 1727b09000001 |
13 | 7c7a0b642b5a |
14 | 3753635bb053 |
15 | 19b78695b2b7 |
hex | cfd41b91001 |
14281868906497 has 2 divisors, whose sum is σ = 14281868906498. Its totient is φ = 14281868906496.
The previous prime is 14281868906491. The next prime is 14281868906563. The reversal of 14281868906497 is 79460986818241.
It is a Cunningham number, because it is equal to 19444+1.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14281868906496 + 1 = 3779136^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 14281868906497 - 231 = 14279721422849 is a prime.
It is a super-2 number, since 2×142818689064972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14281868906491) by changing a digit.
It is a Pierpont prime, being equal to 212 ⋅ 320 + 1.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7140934453248 + 7140934453249.
It is an arithmetic number, because the mean of its divisors is an integer number (7140934453249).
Almost surely, 214281868906497 is an apocalyptic number.
It is an amenable number.
14281868906497 is a deficient number, since it is larger than the sum of its proper divisors (1).
14281868906497 is an equidigital number, since it uses as much as digits as its factorization.
14281868906497 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 334430208, while the sum is 73.
The spelling of 14281868906497 in words is "fourteen trillion, two hundred eighty-one billion, eight hundred sixty-eight million, nine hundred six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •