Base | Representation |
---|---|
bin | 1100110001010100010111… |
… | …0110111001101001111101 |
3 | 1211201100100201011120120202 |
4 | 3030111011312321221331 |
5 | 3320023312022013321 |
6 | 45510312255453245 |
7 | 2646313323443102 |
oct | 314250566715175 |
9 | 54640321146522 |
10 | 14041420110461 |
11 | 4523a29658737 |
12 | 16a93a3227225 |
13 | 7ab13c2a6753 |
14 | 3678734a4aa9 |
15 | 1953b23ed70b |
hex | cc545db9a7d |
14041420110461 has 2 divisors, whose sum is σ = 14041420110462. Its totient is φ = 14041420110460.
The previous prime is 14041420110439. The next prime is 14041420110503. The reversal of 14041420110461 is 16401102414041.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10263084996025 + 3778335114436 = 3203605^2 + 1943794^2 .
It is an emirp because it is prime and its reverse (16401102414041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14041420110461 - 230 = 14040346368637 is a prime.
It is a super-2 number, since 2×140414201104612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14041420116461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7020710055230 + 7020710055231.
It is an arithmetic number, because the mean of its divisors is an integer number (7020710055231).
Almost surely, 214041420110461 is an apocalyptic number.
It is an amenable number.
14041420110461 is a deficient number, since it is larger than the sum of its proper divisors (1).
14041420110461 is an equidigital number, since it uses as much as digits as its factorization.
14041420110461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 29.
The spelling of 14041420110461 in words is "fourteen trillion, forty-one billion, four hundred twenty million, one hundred ten thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •