Base | Representation |
---|---|
bin | 1000110011010… |
… | …1101100000110 |
3 | 2120110201211000 |
4 | 2030311230012 |
5 | 33422420240 |
6 | 3355154130 |
7 | 625546455 |
oct | 214655406 |
9 | 76421730 |
10 | 36920070 |
11 | 19927660 |
12 | 10445946 |
13 | 78589c5 |
14 | 4c90b9c |
15 | 3394430 |
hex | 2335b06 |
36920070 has 128 divisors (see below), whose sum is σ = 111144960. Its totient is φ = 8640000.
The previous prime is 36920069. The next prime is 36920099. The reversal of 36920070 is 7002963.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 91870 + ... + 92270.
It is an arithmetic number, because the mean of its divisors is an integer number (868320).
Almost surely, 236920070 is an apocalyptic number.
36920070 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 36920070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55572480).
36920070 is an abundant number, since it is smaller than the sum of its proper divisors (74224890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36920070 is a wasteful number, since it uses less digits than its factorization.
36920070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459 (or 453 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 36920070 is about 6076.1887725778. The cubic root of 36920070 is about 332.9820621780.
The spelling of 36920070 in words is "thirty-six million, nine hundred twenty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •