Base | Representation |
---|---|
bin | 1000101010011… |
… | …11111001111101 |
3 | 12001202110220012 |
4 | 10111033321331 |
5 | 122101212122 |
6 | 11113433005 |
7 | 1541522144 |
oct | 425177175 |
9 | 161673805 |
10 | 72679037 |
11 | 38030922 |
12 | 2040b765 |
13 | 12099062 |
14 | 991c75b |
15 | 65a97e2 |
hex | 454fe7d |
72679037 has 2 divisors, whose sum is σ = 72679038. Its totient is φ = 72679036.
The previous prime is 72679007. The next prime is 72679039. The reversal of 72679037 is 73097627.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46526041 + 26152996 = 6821^2 + 5114^2 .
It is an emirp because it is prime and its reverse (73097627) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 72679037 - 218 = 72416893 is a prime.
Together with 72679039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 72678985 and 72679003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (72679039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36339518 + 36339519.
It is an arithmetic number, because the mean of its divisors is an integer number (36339519).
Almost surely, 272679037 is an apocalyptic number.
It is an amenable number.
72679037 is a deficient number, since it is larger than the sum of its proper divisors (1).
72679037 is an equidigital number, since it uses as much as digits as its factorization.
72679037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 111132, while the sum is 41.
The square root of 72679037 is about 8525.2001149533. The cubic root of 72679037 is about 417.3205022787.
The spelling of 72679037 in words is "seventy-two million, six hundred seventy-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •