Base | Representation |
---|---|
bin | 100000000100111010011101… |
… | …000110001100010001100011 |
3 | 200111111122120110202002122211 |
4 | 200010322131012030101203 |
5 | 121442333332122403332 |
6 | 1220013004245142551 |
7 | 41500225161603544 |
oct | 4004723506142143 |
9 | 614448513662584 |
10 | 141075131450467 |
11 | 40a50699978965 |
12 | 139a53800baa57 |
13 | 60944352881b6 |
14 | 26ba103a684cb |
15 | 1149a4bad3447 |
hex | 804e9d18c463 |
141075131450467 has 2 divisors, whose sum is σ = 141075131450468. Its totient is φ = 141075131450466.
The previous prime is 141075131450441. The next prime is 141075131450489. The reversal of 141075131450467 is 764054131570141.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141075131450467 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141075131450467.
It is not a weakly prime, because it can be changed into another prime (141075131459467) 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, 70537565725233 + 70537565725234.
It is an arithmetic number, because the mean of its divisors is an integer number (70537565725234).
Almost surely, 2141075131450467 is an apocalyptic number.
141075131450467 is a deficient number, since it is larger than the sum of its proper divisors (1).
141075131450467 is an equidigital number, since it uses as much as digits as its factorization.
141075131450467 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1411200, while the sum is 49.
The spelling of 141075131450467 in words is "one hundred forty-one trillion, seventy-five billion, one hundred thirty-one million, four hundred fifty thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •