Base | Representation |
---|---|
bin | 1000110000001… |
… | …1001011000000 |
3 | 2120002012222101 |
4 | 2030003023000 |
5 | 33344310102 |
6 | 3350520144 |
7 | 624025300 |
oct | 214031300 |
9 | 76065871 |
10 | 36713152 |
11 | 197a6153 |
12 | 10366054 |
13 | 77b5778 |
14 | 4c39600 |
15 | 3352e87 |
hex | 23032c0 |
36713152 has 84 divisors (see below), whose sum is σ = 88605360. Its totient is φ = 15020544.
The previous prime is 36713147. The next prime is 36713161. The reversal of 36713152 is 25131763.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 36713152.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71874 + ... + 72382.
Almost surely, 236713152 is an apocalyptic number.
36713152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 36713152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44302680).
36713152 is an abundant number, since it is smaller than the sum of its proper divisors (51892208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36713152 is a wasteful number, since it uses less digits than its factorization.
36713152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 558 (or 541 counting only the distinct ones).
The product of its digits is 3780, while the sum is 28.
The square root of 36713152 is about 6059.1378924728. The cubic root of 36713152 is about 332.3588320402.
The spelling of 36713152 in words is "thirty-six million, seven hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •