Base | Representation |
---|---|
bin | 1000001110111111011… |
… | …1100110100101100111 |
3 | 111112010211010102010112 |
4 | 2003233313212211213 |
5 | 4304204100042241 |
6 | 144553133043235 |
7 | 13135410034424 |
oct | 2035767464547 |
9 | 445124112115 |
10 | 141463284071 |
11 | 54aa337711a |
12 | 234bb92651b |
13 | 10455a9a465 |
14 | 6bbdad4d4b |
15 | 3a2e4171eb |
hex | 20efde6967 |
141463284071 has 2 divisors, whose sum is σ = 141463284072. Its totient is φ = 141463284070.
The previous prime is 141463284059. The next prime is 141463284077. The reversal of 141463284071 is 170482364141.
It is a strong prime.
It is an emirp because it is prime and its reverse (170482364141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141463284071 - 222 = 141459089767 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141463284077) 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, 70731642035 + 70731642036.
It is an arithmetic number, because the mean of its divisors is an integer number (70731642036).
Almost surely, 2141463284071 is an apocalyptic number.
141463284071 is a deficient number, since it is larger than the sum of its proper divisors (1).
141463284071 is an equidigital number, since it uses as much as digits as its factorization.
141463284071 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 41.
The spelling of 141463284071 in words is "one hundred forty-one billion, four hundred sixty-three million, two hundred eighty-four thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •