Base | Representation |
---|---|
bin | 10000110010000… |
… | …01000010011101 |
3 | 100210220010210102 |
4 | 20121001002131 |
5 | 242014304311 |
6 | 21545150445 |
7 | 3326400302 |
oct | 1031010235 |
9 | 323803712 |
10 | 140775581 |
11 | 72511861 |
12 | 3b18b425 |
13 | 2321c37b |
14 | 149a70a9 |
15 | c55b43b |
hex | 864109d |
140775581 has 2 divisors, whose sum is σ = 140775582. Its totient is φ = 140775580.
The previous prime is 140775539. The next prime is 140775601. The reversal of 140775581 is 185577041.
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., 121992025 + 18783556 = 11045^2 + 4334^2 .
It is a cyclic number.
It is not a de Polignac number, because 140775581 - 214 = 140759197 is a prime.
It is a super-2 number, since 2×1407755812 = 39635528411775122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p7953455 and since 140775581 and 7953455 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140775511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70387790 + 70387791.
It is an arithmetic number, because the mean of its divisors is an integer number (70387791).
Almost surely, 2140775581 is an apocalyptic number.
It is an amenable number.
140775581 is a deficient number, since it is larger than the sum of its proper divisors (1).
140775581 is an equidigital number, since it uses as much as digits as its factorization.
140775581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 39200, while the sum is 38.
The square root of 140775581 is about 11864.8885793336. Note that the first 3 decimals coincide. The cubic root of 140775581 is about 520.2065020562.
The spelling of 140775581 in words is "one hundred forty million, seven hundred seventy-five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •