Base | Representation |
---|---|
bin | 10000010101111… |
… | …01110100101000 |
3 | 100112222000102000 |
4 | 20022331310220 |
5 | 240043424032 |
6 | 21334211000 |
7 | 3253160163 |
oct | 1012756450 |
9 | 315860360 |
10 | 137092392 |
11 | 704265a8 |
12 | 39ab3a60 |
13 | 2252ca78 |
14 | 142c8ada |
15 | c07ee7c |
hex | 82bdd28 |
137092392 has 32 divisors (see below), whose sum is σ = 380812800. Its totient is φ = 45697392.
The previous prime is 137092387. The next prime is 137092393. The reversal of 137092392 is 293290731.
It is a super-3 number, since 3×1370923923 (a number of 25 digits) contains 333 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 (137092393) by changing a digit.
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, 317128 + ... + 317559.
It is an arithmetic number, because the mean of its divisors is an integer number (11900400).
Almost surely, 2137092392 is an apocalyptic number.
137092392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
137092392 is an abundant number, since it is smaller than the sum of its proper divisors (243720408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137092392 is a wasteful number, since it uses less digits than its factorization.
137092392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634702 (or 634692 counting only the distinct ones).
The product of its (nonzero) digits is 20412, while the sum is 36.
The square root of 137092392 is about 11708.6460361564. The cubic root of 137092392 is about 515.6295339767.
The spelling of 137092392 in words is "one hundred thirty-seven million, ninety-two thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •