Base | Representation |
---|---|
bin | 1000101111110… |
… | …0010011101110 |
3 | 2120000210102010 |
4 | 2023330103232 |
5 | 33342410123 |
6 | 3350142050 |
7 | 623550315 |
oct | 213742356 |
9 | 76023363 |
10 | 36685038 |
11 | 19787015 |
12 | 10351926 |
13 | 77a5a30 |
14 | 4c2d27c |
15 | 3349993 |
hex | 22fc4ee |
36685038 has 32 divisors (see below), whose sum is σ = 79613856. Its totient is φ = 11202048.
The previous prime is 36685021. The next prime is 36685039. The reversal of 36685038 is 83058663.
It is a super-2 number, since 2×366850382 = 2691584026122888, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 36684987 and 36685005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36685039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8970 + ... + 12402.
It is an arithmetic number, because the mean of its divisors is an integer number (2487933).
Almost surely, 236685038 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 36685038, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39806928).
36685038 is an abundant number, since it is smaller than the sum of its proper divisors (42928818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36685038 is a wasteful number, since it uses less digits than its factorization.
36685038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588.
The product of its (nonzero) digits is 103680, while the sum is 39.
The square root of 36685038 is about 6056.8174811530. The cubic root of 36685038 is about 332.2739730562.
The spelling of 36685038 in words is "thirty-six million, six hundred eighty-five thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •