Base | Representation |
---|---|
bin | 1000001011101000110… |
… | …1011011010010010001 |
3 | 111102211002011000221202 |
4 | 2002322031123102101 |
5 | 4300333114112111 |
6 | 144323533400545 |
7 | 13104166041404 |
oct | 2027215332221 |
9 | 442732130852 |
10 | 140563035281 |
11 | 54681194959 |
12 | 232aa339155 |
13 | 10341417776 |
14 | 6b36311d3b |
15 | 39ca38bb3b |
hex | 20ba35b491 |
140563035281 has 2 divisors, whose sum is σ = 140563035282. Its totient is φ = 140563035280.
The previous prime is 140563035251. The next prime is 140563035299. The reversal of 140563035281 is 182530365041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103308245056 + 37254790225 = 321416^2 + 193015^2 .
It is an emirp because it is prime and its reverse (182530365041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140563035281 - 230 = 139489293457 is a prime.
It is a super-2 number, since 2×1405630352812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140563035211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70281517640 + 70281517641.
It is an arithmetic number, because the mean of its divisors is an integer number (70281517641).
Almost surely, 2140563035281 is an apocalyptic number.
It is an amenable number.
140563035281 is a deficient number, since it is larger than the sum of its proper divisors (1).
140563035281 is an equidigital number, since it uses as much as digits as its factorization.
140563035281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 140563035281 in words is "one hundred forty billion, five hundred sixty-three million, thirty-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •