Base | Representation |
---|---|
bin | 1000110010010… |
… | …1001100000001 |
3 | 2120100022002201 |
4 | 2030211030001 |
5 | 33413234411 |
6 | 3353513201 |
7 | 625145431 |
oct | 214451401 |
9 | 76308081 |
10 | 36852481 |
11 | 198908a6 |
12 | 10412801 |
13 | 7834003 |
14 | 4c742c1 |
15 | 337e3c1 |
hex | 2325301 |
36852481 has 16 divisors (see below), whose sum is σ = 41081040. Its totient is φ = 32901120.
The previous prime is 36852469. The next prime is 36852499. The reversal of 36852481 is 18425863.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1032256 + 35820225 = 1016^2 + 5985^2 .
It is not a de Polignac number, because 36852481 - 25 = 36852449 is a prime.
It is a super-2 number, since 2×368524812 = 2716210711710722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 36852481.
It is not an unprimeable number, because it can be changed into a prime (36852401) 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, 25075 + ... + 26503.
It is an arithmetic number, because the mean of its divisors is an integer number (2567565).
It is a Poulet number, since it divides 236852480-1.
Almost surely, 236852481 is an apocalyptic number.
It is an amenable number.
36852481 is a deficient number, since it is larger than the sum of its proper divisors (4228559).
36852481 is a wasteful number, since it uses less digits than its factorization.
36852481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524.
The product of its digits is 46080, while the sum is 37.
The square root of 36852481 is about 6070.6244324616. The cubic root of 36852481 is about 332.7787430227.
The spelling of 36852481 in words is "thirty-six million, eight hundred fifty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •