Base | Representation |
---|---|
bin | 101101111001111… |
… | …000111011111101 |
3 | 1222200011200101022 |
4 | 231321320323331 |
5 | 3034124301031 |
6 | 204230553525 |
7 | 25041111455 |
oct | 5571707375 |
9 | 1880150338 |
10 | 770150141 |
11 | 365803222 |
12 | 195b088a5 |
13 | c3731357 |
14 | 743d8d65 |
15 | 4792c97b |
hex | 2de78efd |
770150141 has 2 divisors, whose sum is σ = 770150142. Its totient is φ = 770150140.
The previous prime is 770150107. The next prime is 770150203. The reversal of 770150141 is 141051077.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 627252025 + 142898116 = 25045^2 + 11954^2 .
It is an emirp because it is prime and its reverse (141051077) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 770150141 - 226 = 703041277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 770150141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (770110141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 385075070 + 385075071.
It is an arithmetic number, because the mean of its divisors is an integer number (385075071).
Almost surely, 2770150141 is an apocalyptic number.
It is an amenable number.
770150141 is a deficient number, since it is larger than the sum of its proper divisors (1).
770150141 is an equidigital number, since it uses as much as digits as its factorization.
770150141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 980, while the sum is 26.
The square root of 770150141 is about 27751.5790721897. The cubic root of 770150141 is about 916.6252147573.
The spelling of 770150141 in words is "seven hundred seventy million, one hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •