Base | Representation |
---|---|
bin | 100000001001110010101101… |
… | …111011111000101011000001 |
3 | 200112200201000101221211201121 |
4 | 200021302231323320223001 |
5 | 122013332020340113442 |
6 | 1220431014544432241 |
7 | 41533365032335111 |
oct | 4011625573705301 |
9 | 615621011854647 |
10 | 141410421410497 |
11 | 4106a906362488 |
12 | 13a3a354018681 |
13 | 60b9c3a401755 |
14 | 26cc42d9d5041 |
15 | 11536224eb967 |
hex | 809cadef8ac1 |
141410421410497 has 2 divisors, whose sum is σ = 141410421410498. Its totient is φ = 141410421410496.
The previous prime is 141410421410491. The next prime is 141410421410513. The reversal of 141410421410497 is 794014124014141.
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., 75329276411536 + 66081144998961 = 8679244^2 + 8129031^2 .
It is a cyclic number.
It is not a de Polignac number, because 141410421410497 - 219 = 141410420886209 is a prime.
It is not a weakly prime, because it can be changed into another prime (141410421410491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70705210705248 + 70705210705249.
It is an arithmetic number, because the mean of its divisors is an integer number (70705210705249).
Almost surely, 2141410421410497 is an apocalyptic number.
It is an amenable number.
141410421410497 is a deficient number, since it is larger than the sum of its proper divisors (1).
141410421410497 is an equidigital number, since it uses as much as digits as its factorization.
141410421410497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 43.
The spelling of 141410421410497 in words is "one hundred forty-one trillion, four hundred ten billion, four hundred twenty-one million, four hundred ten thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •