Base | Representation |
---|---|
bin | 10000011010101… |
… | …01100110011100 |
3 | 100121010121012100 |
4 | 20031111212130 |
5 | 240223322301 |
6 | 21355405100 |
7 | 3261356523 |
oct | 1015254634 |
9 | 317117170 |
10 | 137714076 |
11 | 70810695 |
12 | 3a153790 |
13 | 226b9a26 |
14 | 1440b4ba |
15 | c154286 |
hex | 835599c |
137714076 has 36 divisors (see below), whose sum is σ = 368589312. Its totient is φ = 43204224.
The previous prime is 137714023. The next prime is 137714077. The reversal of 137714076 is 670417731.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 137714076.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137714077) 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 11 ways as a sum of consecutive naturals, for example, 111900 + ... + 113123.
It is an arithmetic number, because the mean of its divisors is an integer number (10238592).
Almost surely, 2137714076 is an apocalyptic number.
It is an amenable number.
137714076 is an abundant number, since it is smaller than the sum of its proper divisors (230875236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137714076 is a wasteful number, since it uses less digits than its factorization.
137714076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225050 (or 225045 counting only the distinct ones).
The product of its (nonzero) digits is 24696, while the sum is 36.
The square root of 137714076 is about 11735.1640806595. The cubic root of 137714076 is about 516.4077811358.
The spelling of 137714076 in words is "one hundred thirty-seven million, seven hundred fourteen thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •