Base | Representation |
---|---|
bin | 11111111010011100110001… |
… | …000100100110001110011101 |
3 | 200101221220112010010000100122 |
4 | 133322130301010212032131 |
5 | 121344043202221222332 |
6 | 1214302403355004325 |
7 | 41364250666413446 |
oct | 3772346104461635 |
9 | 611856463100318 |
10 | 140356059554717 |
11 | 407a37415a8756 |
12 | 138a9b404396a5 |
13 | 604169a7ca156 |
14 | 26933ab8322cd |
15 | 1135eb34ddc12 |
hex | 7fa73112639d |
140356059554717 has 2 divisors, whose sum is σ = 140356059554718. Its totient is φ = 140356059554716.
The previous prime is 140356059554681. The next prime is 140356059554749. The reversal of 140356059554717 is 717455950653041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139035557499556 + 1320502055161 = 11791334^2 + 1149131^2 .
It is a cyclic number.
It is not a de Polignac number, because 140356059554717 - 210 = 140356059553693 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140356059554717.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140352059554717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70178029777358 + 70178029777359.
It is an arithmetic number, because the mean of its divisors is an integer number (70178029777359).
Almost surely, 2140356059554717 is an apocalyptic number.
It is an amenable number.
140356059554717 is a deficient number, since it is larger than the sum of its proper divisors (1).
140356059554717 is an equidigital number, since it uses as much as digits as its factorization.
140356059554717 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 79380000, while the sum is 62.
The spelling of 140356059554717 in words is "one hundred forty trillion, three hundred fifty-six billion, fifty-nine million, five hundred fifty-four thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •