Base | Representation |
---|---|
bin | 100000000011111010010100… |
… | …001000001101001001010111 |
3 | 200111021001210210210110102211 |
4 | 200003322110020031021113 |
5 | 121440221310421203042 |
6 | 1215521214323214251 |
7 | 41462236416001405 |
oct | 4003722410151127 |
9 | 614231723713384 |
10 | 141006261506647 |
11 | 40a2446865a819 |
12 | 13993b5b817387 |
13 | 608aaaacb5c54 |
14 | 26b6a4d176475 |
15 | 1147d6a7e4017 |
hex | 803e9420d257 |
141006261506647 has 2 divisors, whose sum is σ = 141006261506648. Its totient is φ = 141006261506646.
The previous prime is 141006261506639. The next prime is 141006261506653. The reversal of 141006261506647 is 746605162600141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 141006261506647 - 23 = 141006261506639 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141006261506647.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141006261506447) 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, 70503130753323 + 70503130753324.
It is an arithmetic number, because the mean of its divisors is an integer number (70503130753324).
Almost surely, 2141006261506647 is an apocalyptic number.
141006261506647 is a deficient number, since it is larger than the sum of its proper divisors (1).
141006261506647 is an equidigital number, since it uses as much as digits as its factorization.
141006261506647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 141006261506647 in words is "one hundred forty-one trillion, six billion, two hundred sixty-one million, five hundred six thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •