Base | Representation |
---|---|
bin | 1000101100101… |
… | …1010000011111 |
3 | 2112122120210222 |
4 | 2023023100133 |
5 | 33314443002 |
6 | 3341551555 |
7 | 622052501 |
oct | 213132037 |
9 | 75576728 |
10 | 36484127 |
11 | 1965a079 |
12 | 102755bb |
13 | 7735454 |
14 | 4bb9d71 |
15 | 330a1a2 |
hex | 22cb41f |
36484127 has 4 divisors (see below), whose sum is σ = 36708120. Its totient is φ = 36260136.
The previous prime is 36484103. The next prime is 36484157. The reversal of 36484127 is 72148463.
36484127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72148463 = 449 ⋅160687.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-36484127 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36484157) 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 in 3 ways as a sum of consecutive naturals, for example, 111752 + ... + 112077.
It is an arithmetic number, because the mean of its divisors is an integer number (9177030).
Almost surely, 236484127 is an apocalyptic number.
36484127 is a deficient number, since it is larger than the sum of its proper divisors (223993).
36484127 is a wasteful number, since it uses less digits than its factorization.
36484127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223992.
The product of its digits is 32256, while the sum is 35.
The square root of 36484127 is about 6040.2091851193. The cubic root of 36484127 is about 331.6662799195. Note that the first 3 decimals are identical.
The spelling of 36484127 in words is "thirty-six million, four hundred eighty-four thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •