Base | Representation |
---|---|
bin | 1000101101011… |
… | …0101000110101 |
3 | 2112201221202102 |
4 | 2023112220311 |
5 | 33322440431 |
6 | 3342551445 |
7 | 622335422 |
oct | 213265065 |
9 | 75657672 |
10 | 36530741 |
11 | 196910a5 |
12 | 10298585 |
13 | 7750730 |
14 | 4bccd49 |
15 | 3318dcb |
hex | 22d6a35 |
36530741 has 8 divisors (see below), whose sum is σ = 40610304. Its totient is φ = 32632560.
The previous prime is 36530731. The next prime is 36530743. The reversal of 36530741 is 14703563.
36530741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 36530741 - 26 = 36530677 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 (36530743) 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 7 ways as a sum of consecutive naturals, for example, 44921 + ... + 45726.
It is an arithmetic number, because the mean of its divisors is an integer number (5076288).
Almost surely, 236530741 is an apocalyptic number.
36530741 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
36530741 is a deficient number, since it is larger than the sum of its proper divisors (4079563).
36530741 is a wasteful number, since it uses less digits than its factorization.
36530741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90691.
The product of its (nonzero) digits is 7560, while the sum is 29.
The square root of 36530741 is about 6044.0665946033. The cubic root of 36530741 is about 331.8074711135.
The spelling of 36530741 in words is "thirty-six million, five hundred thirty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •