Base | Representation |
---|---|
bin | 100010001101010010… |
… | …010011011101110001 |
3 | 10111210210012122002100 |
4 | 202031102103131301 |
5 | 1100210402433040 |
6 | 24512410011013 |
7 | 2440130622021 |
oct | 421522233561 |
9 | 114723178070 |
10 | 36730124145 |
11 | 14639219a00 |
12 | 7150a16a69 |
13 | 36047b9890 |
14 | 1ac61d3a81 |
15 | e4e8d4b30 |
hex | 88d493771 |
36730124145 has 216 divisors, whose sum is σ = 78177343608. Its totient is φ = 15846082560.
The previous prime is 36730124107. The next prime is 36730124149. The reversal of 36730124145 is 54142103763.
36730124145 is a `hidden beast` number, since 367 + 30 + 124 + 145 = 666.
It can be written as a sum of positive squares in 12 ways, for example, as 24015081024 + 12715043121 = 154968^2 + 112761^2 .
It is not a de Polignac number, because 36730124145 - 210 = 36730123121 is a prime.
It is a super-2 number, since 2×367301241452 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (36730124149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 59529877 + ... + 59530493.
Almost surely, 236730124145 is an apocalyptic number.
It is an amenable number.
36730124145 is an abundant number, since it is smaller than the sum of its proper divisors (41447219463).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36730124145 is a wasteful number, since it uses less digits than its factorization.
36730124145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 721 (or 678 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 36.
The spelling of 36730124145 in words is "thirty-six billion, seven hundred thirty million, one hundred twenty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •