Base | Representation |
---|---|
bin | 11111110101110000010100… |
… | …000100100100011110110101 |
3 | 200100211001210221012000210012 |
4 | 133311300110010210132311 |
5 | 121323302001304223414 |
6 | 1213454251250310005 |
7 | 41332040305360232 |
oct | 3765602404443665 |
9 | 610731727160705 |
10 | 140033450461109 |
11 | 40689942136827 |
12 | 13857507288305 |
13 | 601a1368b885a |
14 | 2681925aba789 |
15 | 112c8d0ed933e |
hex | 7f5c141247b5 |
140033450461109 has 2 divisors, whose sum is σ = 140033450461110. Its totient is φ = 140033450461108.
The previous prime is 140033450461067. The next prime is 140033450461321. The reversal of 140033450461109 is 901164054330041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131291836810225 + 8741613650884 = 11458265^2 + 2956622^2 .
It is an emirp because it is prime and its reverse (901164054330041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140033450461109 - 224 = 140033433683893 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140033450451109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70016725230554 + 70016725230555.
It is an arithmetic number, because the mean of its divisors is an integer number (70016725230555).
Almost surely, 2140033450461109 is an apocalyptic number.
It is an amenable number.
140033450461109 is a deficient number, since it is larger than the sum of its proper divisors (1).
140033450461109 is an equidigital number, since it uses as much as digits as its factorization.
140033450461109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 140033450461109 in words is "one hundred forty trillion, thirty-three billion, four hundred fifty million, four hundred sixty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •