Base | Representation |
---|---|
bin | 1000101010010… |
… | …01111101000101 |
3 | 12001201020110101 |
4 | 10111021331011 |
5 | 122044422121 |
6 | 11113124101 |
7 | 1541361112 |
oct | 425117505 |
9 | 161636411 |
10 | 72654661 |
11 | 38014582 |
12 | 203b9631 |
13 | 1208ac31 |
14 | 9913909 |
15 | 65a2491 |
hex | 4549f45 |
72654661 has 2 divisors, whose sum is σ = 72654662. Its totient is φ = 72654660.
The previous prime is 72654619. The next prime is 72654691. The reversal of 72654661 is 16645627.
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., 71402500 + 1252161 = 8450^2 + 1119^2 .
It is an emirp because it is prime and its reverse (16645627) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-72654661 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 72654661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (72654691) 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, 36327330 + 36327331.
It is an arithmetic number, because the mean of its divisors is an integer number (36327331).
Almost surely, 272654661 is an apocalyptic number.
It is an amenable number.
72654661 is a deficient number, since it is larger than the sum of its proper divisors (1).
72654661 is an equidigital number, since it uses as much as digits as its factorization.
72654661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 60480, while the sum is 37.
The square root of 72654661 is about 8523.7703512002. The cubic root of 72654661 is about 417.2738416804.
The spelling of 72654661 in words is "seventy-two million, six hundred fifty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •