Base | Representation |
---|---|
bin | 11111111010010000101111… |
… | …101100110110011001101101 |
3 | 200101220200012112121112102212 |
4 | 133322100233230312121231 |
5 | 121343340233310303123 |
6 | 1214252430453500205 |
7 | 41363313062140415 |
oct | 3772205754663155 |
9 | 611820175545385 |
10 | 140343151650413 |
11 | 40799218406148 |
12 | 138a7539641665 |
13 | 60403c153225a |
14 | 26929053db645 |
15 | 11359aa1ce878 |
hex | 7fa42fb3666d |
140343151650413 has 2 divisors, whose sum is σ = 140343151650414. Its totient is φ = 140343151650412.
The previous prime is 140343151650347. The next prime is 140343151650419. The reversal of 140343151650413 is 314056151343041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129253206005764 + 11089945644649 = 11368958^2 + 3330157^2 .
It is a cyclic number.
It is not a de Polignac number, because 140343151650413 - 28 = 140343151650157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140343151650419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70171575825206 + 70171575825207.
It is an arithmetic number, because the mean of its divisors is an integer number (70171575825207).
Almost surely, 2140343151650413 is an apocalyptic number.
It is an amenable number.
140343151650413 is a deficient number, since it is larger than the sum of its proper divisors (1).
140343151650413 is an equidigital number, since it uses as much as digits as its factorization.
140343151650413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 140343151650413 in words is "one hundred forty trillion, three hundred forty-three billion, one hundred fifty-one million, six hundred fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •