Base | Representation |
---|---|
bin | 1100101110111110110001… |
… | …1011010011100101101001 |
3 | 1211120111201020020112211111 |
4 | 3023233230123103211221 |
5 | 3313344042314430021 |
6 | 45440031540230321 |
7 | 2643362253562435 |
oct | 313575433234551 |
9 | 54514636215744 |
10 | 14001264998761 |
11 | 45089a3096a07 |
12 | 16a165739b3a1 |
13 | 7a7410055721 |
14 | 36594447b9c5 |
15 | 194311ec78e1 |
hex | cbbec6d3969 |
14001264998761 has 2 divisors, whose sum is σ = 14001264998762. Its totient is φ = 14001264998760.
The previous prime is 14001264998731. The next prime is 14001264998789. The reversal of 14001264998761 is 16789946210041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13445099563536 + 556165435225 = 3666756^2 + 745765^2 .
It is a cyclic number.
It is not a de Polignac number, because 14001264998761 - 229 = 14000728127849 is a prime.
It is a super-3 number, since 3×140012649987613 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14001264998696 and 14001264998705.
It is not a weakly prime, because it can be changed into another prime (14001264998731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7000632499380 + 7000632499381.
It is an arithmetic number, because the mean of its divisors is an integer number (7000632499381).
Almost surely, 214001264998761 is an apocalyptic number.
It is an amenable number.
14001264998761 is a deficient number, since it is larger than the sum of its proper divisors (1).
14001264998761 is an equidigital number, since it uses as much as digits as its factorization.
14001264998761 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5225472, while the sum is 58.
The spelling of 14001264998761 in words is "fourteen trillion, one billion, two hundred sixty-four million, nine hundred ninety-eight thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •