Base | Representation |
---|---|
bin | 1000100110011… |
… | …1011110001001 |
3 | 2111212211010222 |
4 | 2021213132021 |
5 | 33213403101 |
6 | 3325115425 |
7 | 615431045 |
oct | 211473611 |
9 | 74784128 |
10 | 36075401 |
11 | 193aaa8a |
12 | 100b8b75 |
13 | 76213bb |
14 | 4b11025 |
15 | 327901b |
hex | 2267789 |
36075401 has 2 divisors, whose sum is σ = 36075402. Its totient is φ = 36075400.
The previous prime is 36075353. The next prime is 36075419. The reversal of 36075401 is 10457063.
36075401 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., 36060025 + 15376 = 6005^2 + 124^2 .
It is an emirp because it is prime and its reverse (10457063) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36075401 - 26 = 36075337 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a plaindrome in base 16.
It is not a weakly prime, because it can be changed into another prime (36075421) 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, 18037700 + 18037701.
It is an arithmetic number, because the mean of its divisors is an integer number (18037701).
Almost surely, 236075401 is an apocalyptic number.
It is an amenable number.
36075401 is a deficient number, since it is larger than the sum of its proper divisors (1).
36075401 is an equidigital number, since it uses as much as digits as its factorization.
36075401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 36075401 is about 6006.2801299973. The cubic root of 36075401 is about 330.4230906294.
The spelling of 36075401 in words is "thirty-six million, seventy-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •