Base | Representation |
---|---|
bin | 100010010001100111… |
… | …010111101001011100 |
3 | 10111222211212200010002 |
4 | 202101213113221130 |
5 | 1100333001131124 |
6 | 24523522433432 |
7 | 2442002154200 |
oct | 422147275134 |
9 | 114884780102 |
10 | 36802755164 |
11 | 1467621773a |
12 | 7171202878 |
13 | 3616869b06 |
14 | 1ad1adcb00 |
15 | e55e800ae |
hex | 8919d7a5c |
36802755164 has 72 divisors (see below), whose sum is σ = 75375492192. Its totient is φ = 15677020800.
The previous prime is 36802755131. The next prime is 36802755211. The reversal of 36802755164 is 46155720863.
36802755164 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×368027551642 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38058209 + ... + 38059175.
It is an arithmetic number, because the mean of its divisors is an integer number (1046881836).
Almost surely, 236802755164 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 36802755164, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37687746096).
36802755164 is an abundant number, since it is smaller than the sum of its proper divisors (38572737028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36802755164 is a wasteful number, since it uses less digits than its factorization.
36802755164 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1963 (or 1954 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 47.
The spelling of 36802755164 in words is "thirty-six billion, eight hundred two million, seven hundred fifty-five thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •