Base | Representation |
---|---|
bin | 100001111011001000… |
… | …010111101100101000 |
3 | 10111000120001122200100 |
4 | 201323020113230220 |
5 | 1044044413431102 |
6 | 24422245305400 |
7 | 2426441616624 |
oct | 417310275450 |
9 | 114016048610 |
10 | 36425530152 |
11 | 144a2297a30 |
12 | 7086a05260 |
13 | 3586670a4b |
14 | 1a97986184 |
15 | e32cb9a1c |
hex | 87b217b28 |
36425530152 has 48 divisors (see below), whose sum is σ = 107620886880. Its totient is φ = 11038039200.
The previous prime is 36425530129. The next prime is 36425530157. The reversal of 36425530152 is 25103552463.
36425530152 is a `hidden beast` number, since 3 + 642 + 5 + 5 + 3 + 0 + 1 + 5 + 2 = 666.
It is a super-2 number, since 2×364255301522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (36425530157) 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 11 ways as a sum of consecutive naturals, for example, 22995124 + ... + 22996707.
It is an arithmetic number, because the mean of its divisors is an integer number (2242101810).
Almost surely, 236425530152 is an apocalyptic number.
It is an amenable number.
36425530152 is an abundant number, since it is smaller than the sum of its proper divisors (71195356728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36425530152 is a wasteful number, since it uses less digits than its factorization.
36425530152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45991854 (or 45991847 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 36425530152 in words is "thirty-six billion, four hundred twenty-five million, five hundred thirty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •