Base | Representation |
---|---|
bin | 100001110111111… |
… | …1100000101010110 |
3 | 2221012210022102110 |
4 | 1003233330011112 |
5 | 4311434442332 |
6 | 304442051450 |
7 | 40111166145 |
oct | 10357740526 |
9 | 2835708373 |
10 | 1136640342 |
11 | 533670792 |
12 | 2787a9b86 |
13 | 15163c266 |
14 | aad5975c |
15 | 69bc24cc |
hex | 43bfc156 |
1136640342 has 8 divisors (see below), whose sum is σ = 2273280696. Its totient is φ = 378880112.
The previous prime is 1136640341. The next prime is 1136640343. The reversal of 1136640342 is 2430466311.
It is an interprime number because it is at equal distance from previous prime (1136640341) and next prime (1136640343).
It is a sphenic number, since it is the product of 3 distinct primes.
1136640342 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1136640341) 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 3 ways as a sum of consecutive naturals, for example, 94720023 + ... + 94720034.
It is an arithmetic number, because the mean of its divisors is an integer number (284160087).
Almost surely, 21136640342 is an apocalyptic number.
1136640342 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1136640342 is a wasteful number, since it uses less digits than its factorization.
1136640342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189440062.
The product of its (nonzero) digits is 10368, while the sum is 30.
The square root of 1136640342 is about 33714.0970811914. The cubic root of 1136640342 is about 1043.6167046865.
The spelling of 1136640342 in words is "one billion, one hundred thirty-six million, six hundred forty thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •