Base | Representation |
---|---|
bin | 10000011100000… |
… | …00111010111111 |
3 | 100121110121121022 |
4 | 20032000322333 |
5 | 240300012034 |
6 | 21403254355 |
7 | 3263026043 |
oct | 1016007277 |
9 | 317417538 |
10 | 137891519 |
11 | 70921a37 |
12 | 3a21a3bb |
13 | 2274c71c |
14 | 14456023 |
15 | c18bb2e |
hex | 8380ebf |
137891519 has 4 divisors (see below), whose sum is σ = 137916696. Its totient is φ = 137866344.
The previous prime is 137891473. The next prime is 137891521. The reversal of 137891519 is 915198731.
137891519 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 137891519 - 212 = 137887423 is a prime.
It is a super-2 number, since 2×1378915192 = 38028142024254722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 137891519.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137891599) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 509 + ... + 16614.
It is an arithmetic number, because the mean of its divisors is an integer number (34479174).
Almost surely, 2137891519 is an apocalyptic number.
137891519 is a deficient number, since it is larger than the sum of its proper divisors (25177).
137891519 is an equidigital number, since it uses as much as digits as its factorization.
137891519 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25176.
The product of its digits is 68040, while the sum is 44.
The square root of 137891519 is about 11742.7219587283. The cubic root of 137891519 is about 516.6294811022.
The spelling of 137891519 in words is "one hundred thirty-seven million, eight hundred ninety-one thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •