Base | Representation |
---|---|
bin | 1000001010101010001… |
… | …0001100001100100001 |
3 | 111102010202021122102102 |
4 | 2002222202030030201 |
5 | 4244313302334131 |
6 | 144241500500145 |
7 | 13064523455234 |
oct | 2025242141441 |
9 | 442122248372 |
10 | 140300043041 |
11 | 545567979a4 |
12 | 2323624a655 |
13 | 102cbaa6562 |
14 | 6b0d41341b |
15 | 39b223d1cb |
hex | 20aa88c321 |
140300043041 has 2 divisors, whose sum is σ = 140300043042. Its totient is φ = 140300043040.
The previous prime is 140300042989. The next prime is 140300043043. The reversal of 140300043041 is 140340003041.
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., 127107223441 + 13192819600 = 356521^2 + 114860^2 .
It is a cyclic number.
It is not a de Polignac number, because 140300043041 - 26 = 140300042977 is a prime.
It is a Sophie Germain prime.
Together with 140300043043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (140300043043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70150021520 + 70150021521.
It is an arithmetic number, because the mean of its divisors is an integer number (70150021521).
Almost surely, 2140300043041 is an apocalyptic number.
It is an amenable number.
140300043041 is a deficient number, since it is larger than the sum of its proper divisors (1).
140300043041 is an equidigital number, since it uses as much as digits as its factorization.
140300043041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 140300043041 its reverse (140340003041), we get a palindrome (280640046082).
The spelling of 140300043041 in words is "one hundred forty billion, three hundred million, forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •