Base | Representation |
---|---|
bin | 100001111010000… |
… | …0111010111000000 |
3 | 2221021211221011012 |
4 | 1003310013113000 |
5 | 4312230010404 |
6 | 304521340052 |
7 | 40123405652 |
oct | 10364072700 |
9 | 2837757135 |
10 | 1137735104 |
11 | 534249250 |
12 | 279037628 |
13 | 15193364c |
14 | ab1626d2 |
15 | 69d3ba6e |
hex | 43d075c0 |
1137735104 has 56 divisors (see below), whose sum is σ = 2487478896. Its totient is φ = 512000000.
The previous prime is 1137735091. The next prime is 1137735113. The reversal of 1137735104 is 4015377311.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63104 + ... + 79104.
It is an arithmetic number, because the mean of its divisors is an integer number (44419266).
Almost surely, 21137735104 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 1137735104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1243739448).
1137735104 is an abundant number, since it is smaller than the sum of its proper divisors (1349743792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1137735104 is a wasteful number, since it uses less digits than its factorization.
1137735104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16125 (or 16115 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 32.
The square root of 1137735104 is about 33730.3291415901. The cubic root of 1137735104 is about 1043.9516524148.
The spelling of 1137735104 in words is "one billion, one hundred thirty-seven million, seven hundred thirty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •