Base | Representation |
---|---|
bin | 1000001110000101100… |
… | …1101011000101101111 |
3 | 111111111220101121102012 |
4 | 2003201121223011233 |
5 | 4303204430312132 |
6 | 144513102351435 |
7 | 13126401634004 |
oct | 2034131530557 |
9 | 444456347365 |
10 | 141220557167 |
11 | 54989360878 |
12 | 2345258b57b |
13 | 10417703381 |
14 | 6b9978d8ab |
15 | 3a17e6d0b2 |
hex | 20e166b16f |
141220557167 has 2 divisors, whose sum is σ = 141220557168. Its totient is φ = 141220557166.
The previous prime is 141220557113. The next prime is 141220557187. The reversal of 141220557167 is 761755022141.
141220557167 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 (761755022141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141220557167 - 210 = 141220556143 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141220557187) 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, 70610278583 + 70610278584.
It is an arithmetic number, because the mean of its divisors is an integer number (70610278584).
Almost surely, 2141220557167 is an apocalyptic number.
141220557167 is a deficient number, since it is larger than the sum of its proper divisors (1).
141220557167 is an equidigital number, since it uses as much as digits as its factorization.
141220557167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117600, while the sum is 41.
The spelling of 141220557167 in words is "one hundred forty-one billion, two hundred twenty million, five hundred fifty-seven thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •