Base | Representation |
---|---|
bin | 100010010011110011… |
… | …010001000000000000 |
3 | 10112002101212211220211 |
4 | 202103303101000000 |
5 | 1100421343144341 |
6 | 24531312443504 |
7 | 2442625654312 |
oct | 422363210000 |
9 | 115071784824 |
10 | 36839428096 |
11 | 14694995649 |
12 | 7181549594 |
13 | 362133a183 |
14 | 1ad69277b2 |
15 | e592c6181 |
hex | 893cd1000 |
36839428096 has 39 divisors (see below), whose sum is σ = 73694435191. Its totient is φ = 18413572096.
The previous prime is 36839428091. The next prime is 36839428127. The reversal of 36839428096 is 69082493863.
The square root of 36839428096 is 191936.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 36839428096.
It is not an unprimeable number, because it can be changed into a prime (36839428091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 12282405 + ... + 12285403.
Almost surely, 236839428096 is an apocalyptic number.
36839428096 is the 191936-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 36839428096
36839428096 is an abundant number, since it is smaller than the sum of its proper divisors (36855007095).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36839428096 is an frugal number, since it uses more digits than its factorization.
36839428096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6022 (or 3001 counting only the distinct ones).
The product of its (nonzero) digits is 13436928, while the sum is 58.
The spelling of 36839428096 in words is "thirty-six billion, eight hundred thirty-nine million, four hundred twenty-eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •