Base | Representation |
---|---|
bin | 1001001001010… |
… | …11101100110001 |
3 | 12100101000222012 |
4 | 10210223230301 |
5 | 124120200131 |
6 | 11340252305 |
7 | 1621103111 |
oct | 444535461 |
9 | 170330865 |
10 | 76725041 |
11 | 3a344728 |
12 | 21841095 |
13 | 12b84843 |
14 | a293041 |
15 | 6b0852b |
hex | 492bb31 |
76725041 has 2 divisors, whose sum is σ = 76725042. Its totient is φ = 76725040.
The previous prime is 76724933. The next prime is 76725043. The reversal of 76725041 is 14052767.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52998400 + 23726641 = 7280^2 + 4871^2 .
It is an emirp because it is prime and its reverse (14052767) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 76725041 - 210 = 76724017 is a prime.
It is a Sophie Germain prime.
Together with 76725043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 76724989 and 76725007.
It is not a weakly prime, because it can be changed into another prime (76725043) 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, 38362520 + 38362521.
It is an arithmetic number, because the mean of its divisors is an integer number (38362521).
Almost surely, 276725041 is an apocalyptic number.
It is an amenable number.
76725041 is a deficient number, since it is larger than the sum of its proper divisors (1).
76725041 is an equidigital number, since it uses as much as digits as its factorization.
76725041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11760, while the sum is 32.
The square root of 76725041 is about 8759.2831327683. The cubic root of 76725041 is about 424.9250912960.
The spelling of 76725041 in words is "seventy-six million, seven hundred twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •