Base | Representation |
---|---|
bin | 100000000110101111101101… |
… | …111011000100110010010011 |
3 | 200111221200120100210111000001 |
4 | 200012233231323010302103 |
5 | 122001414213113323131 |
6 | 1220150510223310431 |
7 | 41512303303663423 |
oct | 4006575573046223 |
9 | 614850510714001 |
10 | 141201041542291 |
11 | 40a9a030935495 |
12 | 13a0585b14b417 |
13 | 60a327ca1c103 |
14 | 26c2249c98483 |
15 | 114ce6a862261 |
hex | 806bedec4c93 |
141201041542291 has 2 divisors, whose sum is σ = 141201041542292. Its totient is φ = 141201041542290.
The previous prime is 141201041542289. The next prime is 141201041542331. The reversal of 141201041542291 is 192245140102141.
141201041542291 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141201041542291 - 21 = 141201041542289 is a prime.
Together with 141201041542289, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 141201041542291.
It is not a weakly prime, because it can be changed into another prime (141201041542241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70600520771145 + 70600520771146.
It is an arithmetic number, because the mean of its divisors is an integer number (70600520771146).
Almost surely, 2141201041542291 is an apocalyptic number.
141201041542291 is a deficient number, since it is larger than the sum of its proper divisors (1).
141201041542291 is an equidigital number, since it uses as much as digits as its factorization.
141201041542291 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 37.
The spelling of 141201041542291 in words is "one hundred forty-one trillion, two hundred one billion, forty-one million, five hundred forty-two thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •