Base | Representation |
---|---|
bin | 11111110111100010000001… |
… | …001100011111111101000111 |
3 | 200101020201221120211111220221 |
4 | 133313202001030133331013 |
5 | 121332302021311344201 |
6 | 1214030322200205211 |
7 | 41343621642255511 |
oct | 3767420114377507 |
9 | 611221846744827 |
10 | 140155540340551 |
11 | 407266a374723a |
12 | 138770baa69807 |
13 | 60287c2a59378 |
14 | 26877c87d6bb1 |
15 | 1130b796a84a1 |
hex | 7f788131ff47 |
140155540340551 has 2 divisors, whose sum is σ = 140155540340552. Its totient is φ = 140155540340550.
The previous prime is 140155540340537. The next prime is 140155540340579. The reversal of 140155540340551 is 155043045551041.
It is a weak prime.
It is an emirp because it is prime and its reverse (155043045551041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140155540340551 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140155540340498 and 140155540340507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140155540340581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70077770170275 + 70077770170276.
It is an arithmetic number, because the mean of its divisors is an integer number (70077770170276).
Almost surely, 2140155540340551 is an apocalyptic number.
140155540340551 is a deficient number, since it is larger than the sum of its proper divisors (1).
140155540340551 is an equidigital number, since it uses as much as digits as its factorization.
140155540340551 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 600000, while the sum is 43.
Adding to 140155540340551 its reverse (155043045551041), we get a palindrome (295198585891592).
The spelling of 140155540340551 in words is "one hundred forty trillion, one hundred fifty-five billion, five hundred forty million, three hundred forty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •