Base | Representation |
---|---|
bin | 10000010110000… |
… | …01011001010011 |
3 | 100112222202111001 |
4 | 20023001121103 |
5 | 240044411102 |
6 | 21334402431 |
7 | 3253250641 |
oct | 1013013123 |
9 | 315882431 |
10 | 137107027 |
11 | 704365a2 |
12 | 39b00417 |
13 | 22536625 |
14 | 142d0191 |
15 | c084487 |
hex | 82c1653 |
137107027 has 4 divisors (see below), whose sum is σ = 137242336. Its totient is φ = 136971720.
The previous prime is 137106971. The next prime is 137107039. The reversal of 137107027 is 720701731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 720701731 = 41 ⋅17578091.
It is a cyclic number.
It is not a de Polignac number, because 137107027 - 219 = 136582739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 137106986 and 137107004.
It is not an unprimeable number, because it can be changed into a prime (137107127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66123 + ... + 68164.
It is an arithmetic number, because the mean of its divisors is an integer number (34310584).
Almost surely, 2137107027 is an apocalyptic number.
137107027 is a deficient number, since it is larger than the sum of its proper divisors (135309).
137107027 is a wasteful number, since it uses less digits than its factorization.
137107027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135308.
The product of its (nonzero) digits is 2058, while the sum is 28.
The square root of 137107027 is about 11709.2709849930. The cubic root of 137107027 is about 515.6478816268.
Adding to 137107027 its reverse (720701731), we get a palindrome (857808758).
The spelling of 137107027 in words is "one hundred thirty-seven million, one hundred seven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •