Base | Representation |
---|---|
bin | 11111111100110110100101… |
… | …100110101001101001000101 |
3 | 200102112200211200000110210001 |
4 | 133330312211212221221011 |
5 | 121404244431142132114 |
6 | 1214510320413201301 |
7 | 41412215625042316 |
oct | 3774664546515105 |
9 | 612480750013701 |
10 | 140521223395909 |
11 | 40857797254164 |
12 | 13915b55490231 |
13 | 605412c82c5b5 |
14 | 269b39909660d |
15 | 113a42d498374 |
hex | 7fcda59a9a45 |
140521223395909 has 2 divisors, whose sum is σ = 140521223395910. Its totient is φ = 140521223395908.
The previous prime is 140521223395829. The next prime is 140521223395913. The reversal of 140521223395909 is 909593322125041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134500962477025 + 6020260918884 = 11597455^2 + 2453622^2 .
It is a cyclic number.
It is not a de Polignac number, because 140521223395909 - 225 = 140521189841477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140521223395909.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140521223392909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70260611697954 + 70260611697955.
It is an arithmetic number, because the mean of its divisors is an integer number (70260611697955).
Almost surely, 2140521223395909 is an apocalyptic number.
It is an amenable number.
140521223395909 is a deficient number, since it is larger than the sum of its proper divisors (1).
140521223395909 is an equidigital number, since it uses as much as digits as its factorization.
140521223395909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5248800, while the sum is 55.
The spelling of 140521223395909 in words is "one hundred forty trillion, five hundred twenty-one billion, two hundred twenty-three million, three hundred ninety-five thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •