Base | Representation |
---|---|
bin | 1000110000011… |
… | …0111111001001 |
3 | 2120010000102002 |
4 | 2030012333021 |
5 | 33400310102 |
6 | 3351120345 |
7 | 624121661 |
oct | 214067711 |
9 | 76100362 |
10 | 36728777 |
11 | 19806968 |
12 | 103730b5 |
13 | 77bc907 |
14 | 4c411a1 |
15 | 3357902 |
hex | 2306fc9 |
36728777 has 2 divisors, whose sum is σ = 36728778. Its totient is φ = 36728776.
The previous prime is 36728773. The next prime is 36728779. The reversal of 36728777 is 77782763.
36728777 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28526281 + 8202496 = 5341^2 + 2864^2 .
It is an emirp because it is prime and its reverse (77782763) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36728777 - 22 = 36728773 is a prime.
Together with 36728779, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (36728773) 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, 18364388 + 18364389.
It is an arithmetic number, because the mean of its divisors is an integer number (18364389).
Almost surely, 236728777 is an apocalyptic number.
It is an amenable number.
36728777 is a deficient number, since it is larger than the sum of its proper divisors (1).
36728777 is an equidigital number, since it uses as much as digits as its factorization.
36728777 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 691488, while the sum is 47.
The square root of 36728777 is about 6060.4271301617. The cubic root of 36728777 is about 332.4059756379.
The spelling of 36728777 in words is "thirty-six million, seven hundred twenty-eight thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •