Base | Representation |
---|---|
bin | 1100110001010100010111… |
… | …0110111011000111101101 |
3 | 1211201100100201011212210222 |
4 | 3030111011312323013231 |
5 | 3320023312022211321 |
6 | 45510312255541125 |
7 | 2646313323466433 |
oct | 314250566730755 |
9 | 54640321155728 |
10 | 14041420116461 |
11 | 4523a296621a1 |
12 | 16a93a322a7a5 |
13 | 7ab13c2a93ba |
14 | 3678734a6d53 |
15 | 1953b24003ab |
hex | cc545dbb1ed |
14041420116461 has 2 divisors, whose sum is σ = 14041420116462. Its totient is φ = 14041420116460.
The previous prime is 14041420116433. The next prime is 14041420116463. The reversal of 14041420116461 is 16461102414041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8154342847561 + 5887077268900 = 2855581^2 + 2426330^2 .
It is a cyclic number.
It is not a de Polignac number, because 14041420116461 - 26 = 14041420116397 is a prime.
It is a super-2 number, since 2×140414201164612 (a number of 27 digits) contains 22 as substring.
Together with 14041420116463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14041420116463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7020710058230 + 7020710058231.
It is an arithmetic number, because the mean of its divisors is an integer number (7020710058231).
Almost surely, 214041420116461 is an apocalyptic number.
It is an amenable number.
14041420116461 is a deficient number, since it is larger than the sum of its proper divisors (1).
14041420116461 is an equidigital number, since it uses as much as digits as its factorization.
14041420116461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 35.
The spelling of 14041420116461 in words is "fourteen trillion, forty-one billion, four hundred twenty million, one hundred sixteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •