Base | Representation |
---|---|
bin | 1000101111000… |
… | …1110111000001 |
3 | 2112221121201001 |
4 | 2023301313001 |
5 | 33340022431 |
6 | 3345212001 |
7 | 623311456 |
oct | 213616701 |
9 | 75847631 |
10 | 36642241 |
11 | 19757949 |
12 | 10331001 |
13 | 778c3cc |
14 | 4c1b82d |
15 | 333be61 |
hex | 22f1dc1 |
36642241 has 4 divisors (see below), whose sum is σ = 38570800. Its totient is φ = 34713684.
The previous prime is 36642227. The next prime is 36642251. The reversal of 36642241 is 14224663.
36642241 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14224663 = 41 ⋅346943.
It is not a de Polignac number, because 36642241 - 25 = 36642209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (36642211) 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, 964251 + ... + 964288.
It is an arithmetic number, because the mean of its divisors is an integer number (9642700).
Almost surely, 236642241 is an apocalyptic number.
It is an amenable number.
36642241 is a deficient number, since it is larger than the sum of its proper divisors (1928559).
36642241 is a wasteful number, since it uses less digits than its factorization.
36642241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1928558.
The product of its digits is 6912, while the sum is 28.
The square root of 36642241 is about 6053.2834891487. The cubic root of 36642241 is about 332.1447117967.
The spelling of 36642241 in words is "thirty-six million, six hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •