Base | Representation |
---|---|
bin | 1000010000110111101… |
… | …1101010111001011101 |
3 | 111120102222012201010122 |
4 | 2010031323222321131 |
5 | 4311222210314111 |
6 | 145115151444325 |
7 | 13154043154103 |
oct | 2041573527135 |
9 | 446388181118 |
10 | 141967666781 |
11 | 55232057336 |
12 | 236208266a5 |
13 | 10506428375 |
14 | 6c2aaabc73 |
15 | 3a5d848cdb |
hex | 210deeae5d |
141967666781 has 2 divisors, whose sum is σ = 141967666782. Its totient is φ = 141967666780.
The previous prime is 141967666777. The next prime is 141967666783. The reversal of 141967666781 is 187666769141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127526837881 + 14440828900 = 357109^2 + 120170^2 .
It is an emirp because it is prime and its reverse (187666769141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141967666781 - 22 = 141967666777 is a prime.
It is a super-2 number, since 2×1419676667812 (a number of 23 digits) contains 22 as substring.
Together with 141967666783, 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 (141967666783) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70983833390 + 70983833391.
It is an arithmetic number, because the mean of its divisors is an integer number (70983833391).
Almost surely, 2141967666781 is an apocalyptic number.
It is an amenable number.
141967666781 is a deficient number, since it is larger than the sum of its proper divisors (1).
141967666781 is an equidigital number, since it uses as much as digits as its factorization.
141967666781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18289152, while the sum is 62.
The spelling of 141967666781 in words is "one hundred forty-one billion, nine hundred sixty-seven million, six hundred sixty-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •