Base | Representation |
---|---|
bin | 1000101100001… |
… | …0101100011001 |
3 | 2112120210200210 |
4 | 2023002230121 |
5 | 33312332144 |
6 | 3341121333 |
7 | 621545310 |
oct | 213025431 |
9 | 75523623 |
10 | 36449049 |
11 | 1963578a |
12 | 10259249 |
13 | 77224b0 |
14 | 4bab277 |
15 | 32eeab9 |
hex | 22c2b19 |
36449049 has 32 divisors (see below), whose sum is σ = 62970880. Its totient is φ = 18211392.
The previous prime is 36449009. The next prime is 36449051. The reversal of 36449049 is 94094463.
It is not a de Polignac number, because 36449049 - 27 = 36448921 is a prime.
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 = 36448998 and 36449016.
It is not an unprimeable number, because it can be changed into a prime (36449009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1674 + ... + 8700.
It is an arithmetic number, because the mean of its divisors is an integer number (1967840).
Almost surely, 236449049 is an apocalyptic number.
36449049 is a gapful number since it is divisible by the number (39) formed by its first and last digit.
It is an amenable number.
36449049 is a deficient number, since it is larger than the sum of its proper divisors (26521831).
36449049 is a wasteful number, since it uses less digits than its factorization.
36449049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7069.
The product of its (nonzero) digits is 93312, while the sum is 39.
The square root of 36449049 is about 6037.3047794525. The cubic root of 36449049 is about 331.5599513020.
The spelling of 36449049 in words is "thirty-six million, four hundred forty-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •