Base | Representation |
---|---|
bin | 1000010001001111110… |
… | …1010100011001001111 |
3 | 111120201000102212222002 |
4 | 2010103331110121033 |
5 | 4311424100342231 |
6 | 145133202342515 |
7 | 13156411360646 |
oct | 2042375243117 |
9 | 446630385862 |
10 | 142068762191 |
11 | 55284126864 |
12 | 2364a65aa3b |
13 | 10521363635 |
14 | 6c3a2a635d |
15 | 3a676680cb |
hex | 2113f5464f |
142068762191 has 2 divisors, whose sum is σ = 142068762192. Its totient is φ = 142068762190.
The previous prime is 142068762181. The next prime is 142068762197. The reversal of 142068762191 is 191267860241.
It is a happy number.
142068762191 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (191267860241) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142068762191 is a prime.
It is a super-2 number, since 2×1420687621912 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142068762197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71034381095 + 71034381096.
It is an arithmetic number, because the mean of its divisors is an integer number (71034381096).
Almost surely, 2142068762191 is an apocalyptic number.
142068762191 is a deficient number, since it is larger than the sum of its proper divisors (1).
142068762191 is an equidigital number, since it uses as much as digits as its factorization.
142068762191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 47.
The spelling of 142068762191 in words is "one hundred forty-two billion, sixty-eight million, seven hundred sixty-two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •