Base | Representation |
---|---|
bin | 1000101011001… |
… | …10001001011101 |
3 | 12001221002212102 |
4 | 10111212021131 |
5 | 122112121031 |
6 | 11115414445 |
7 | 1542351563 |
oct | 425461135 |
9 | 161832772 |
10 | 72770141 |
11 | 38093314 |
12 | 20454425 |
13 | 120cb672 |
14 | 9943a33 |
15 | 65c67cb |
hex | 456625d |
72770141 has 2 divisors, whose sum is σ = 72770142. Its totient is φ = 72770140.
The previous prime is 72770119. The next prime is 72770143. The reversal of 72770141 is 14107727.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70728100 + 2042041 = 8410^2 + 1429^2 .
It is an emirp because it is prime and its reverse (14107727) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 72770141 - 210 = 72769117 is a prime.
Together with 72770143, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (72770143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36385070 + 36385071.
It is an arithmetic number, because the mean of its divisors is an integer number (36385071).
Almost surely, 272770141 is an apocalyptic number.
It is an amenable number.
72770141 is a deficient number, since it is larger than the sum of its proper divisors (1).
72770141 is an equidigital number, since it uses as much as digits as its factorization.
72770141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2744, while the sum is 29.
The square root of 72770141 is about 8530.5416592383. The cubic root of 72770141 is about 417.4948014699.
Adding to 72770141 its reverse (14107727), we get a palindrome (86877868).
The spelling of 72770141 in words is "seventy-two million, seven hundred seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •