Base | Representation |
---|---|
bin | 1000001101101001010… |
… | …1110011001011000111 |
3 | 111111012122111102100211 |
4 | 2003122111303023013 |
5 | 4302434114214231 |
6 | 144453231420251 |
7 | 13123433033212 |
oct | 2033225631307 |
9 | 444178442324 |
10 | 141102101191 |
11 | 54928504077 |
12 | 2341a984687 |
13 | 103c8cca18c |
14 | 6b87b56779 |
15 | 3a0c86eeb1 |
hex | 20da5732c7 |
141102101191 has 2 divisors, whose sum is σ = 141102101192. Its totient is φ = 141102101190.
The previous prime is 141102101071. The next prime is 141102101197. The reversal of 141102101191 is 191101201141.
141102101191 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141102101191 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141102101197) 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, 70551050595 + 70551050596.
It is an arithmetic number, because the mean of its divisors is an integer number (70551050596).
Almost surely, 2141102101191 is an apocalyptic number.
141102101191 is a deficient number, since it is larger than the sum of its proper divisors (1).
141102101191 is an equidigital number, since it uses as much as digits as its factorization.
141102101191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 141102101191 in words is "one hundred forty-one billion, one hundred two million, one hundred one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.408 sec. • engine limits •