Base | Representation |
---|---|
bin | 1000101010000… |
… | …00010011111001 |
3 | 12001122020021102 |
4 | 10111000103321 |
5 | 122042141121 |
6 | 11112221145 |
7 | 1541135003 |
oct | 425002371 |
9 | 161566242 |
10 | 72615161 |
11 | 37a97933 |
12 | 2039a7b5 |
13 | 12075c68 |
14 | 9903373 |
15 | 659590b |
hex | 45404f9 |
72615161 has 2 divisors, whose sum is σ = 72615162. Its totient is φ = 72615160.
The previous prime is 72615157. The next prime is 72615167. The reversal of 72615161 is 16151627.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36675136 + 35940025 = 6056^2 + 5995^2 .
It is an emirp because it is prime and its reverse (16151627) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 72615161 - 22 = 72615157 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (72615167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36307580 + 36307581.
It is an arithmetic number, because the mean of its divisors is an integer number (36307581).
Almost surely, 272615161 is an apocalyptic number.
It is an amenable number.
72615161 is a deficient number, since it is larger than the sum of its proper divisors (1).
72615161 is an equidigital number, since it uses as much as digits as its factorization.
72615161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2520, while the sum is 29.
The square root of 72615161 is about 8521.4529864337. The cubic root of 72615161 is about 417.1982085212.
Adding to 72615161 its reverse (16151627), we get a palindrome (88766788).
The spelling of 72615161 in words is "seventy-two million, six hundred fifteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •