Base | Representation |
---|---|
bin | 10000011010100… |
… | …01000011010000 |
3 | 100121002122122010 |
4 | 20031101003100 |
5 | 240222223230 |
6 | 21355142520 |
7 | 3261251301 |
oct | 1015210320 |
9 | 317078563 |
10 | 137695440 |
11 | 707a8693 |
12 | 3a144a40 |
13 | 226b13bc |
14 | 144047a8 |
15 | c14d9b0 |
hex | 83510d0 |
137695440 has 80 divisors (see below), whose sum is σ = 428061888. Its totient is φ = 36615168.
The previous prime is 137695433. The next prime is 137695501. The reversal of 137695440 is 44596731.
137695440 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 124972 + ... + 126068.
Almost surely, 2137695440 is an apocalyptic number.
137695440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 137695440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214030944).
137695440 is an abundant number, since it is smaller than the sum of its proper divisors (290366448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137695440 is a wasteful number, since it uses less digits than its factorization.
137695440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1636 (or 1630 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 137695440 is about 11734.3700299590. The cubic root of 137695440 is about 516.3844859873.
The spelling of 137695440 in words is "one hundred thirty-seven million, six hundred ninety-five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •