Base | Representation |
---|---|
bin | 10000011001111… |
… | …11101000000110 |
3 | 100120222000201210 |
4 | 20030333220012 |
5 | 240212432240 |
6 | 21353432250 |
7 | 3260533233 |
oct | 1014775006 |
9 | 316860653 |
10 | 137624070 |
11 | 7075a001 |
12 | 3a10b686 |
13 | 22687a7c |
14 | 143c678a |
15 | c137780 |
hex | 833fa06 |
137624070 has 16 divisors (see below), whose sum is σ = 330297840. Its totient is φ = 36699744.
The previous prime is 137624059. The next prime is 137624077. The reversal of 137624070 is 70426731.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 4587469 = 137624070 / (1 + 3 + 7 + 6 + 2 + 4 + 0 + 7 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137624077) 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, 2293705 + ... + 2293764.
It is an arithmetic number, because the mean of its divisors is an integer number (20643615).
Almost surely, 2137624070 is an apocalyptic number.
137624070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
137624070 is an abundant number, since it is smaller than the sum of its proper divisors (192673770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137624070 is a wasteful number, since it uses less digits than its factorization.
137624070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4587479.
The product of its (nonzero) digits is 7056, while the sum is 30.
The square root of 137624070 is about 11731.3285692627. The cubic root of 137624070 is about 516.2952534753.
The spelling of 137624070 in words is "one hundred thirty-seven million, six hundred twenty-four thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •