Base | Representation |
---|---|
bin | 10000011000001… |
… | …11101000110111 |
3 | 100120112101011012 |
4 | 20030013220313 |
5 | 240133112433 |
6 | 21344502435 |
7 | 3255556523 |
oct | 1014075067 |
9 | 316471135 |
10 | 137394743 |
11 | 70612782 |
12 | 3a01aa1b |
13 | 22607585 |
14 | 14366d83 |
15 | c0de848 |
hex | 8307a37 |
137394743 has 4 divisors (see below), whose sum is σ = 137577000. Its totient is φ = 137212488.
The previous prime is 137394713. The next prime is 137394767. The reversal of 137394743 is 347493731.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 347493731 = 13 ⋅26730287.
It is a cyclic number.
It is not a de Polignac number, because 137394743 - 26 = 137394679 is a prime.
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 137394743.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137394703) 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 3 ways as a sum of consecutive naturals, for example, 89993 + ... + 91506.
It is an arithmetic number, because the mean of its divisors is an integer number (34394250).
Almost surely, 2137394743 is an apocalyptic number.
137394743 is a deficient number, since it is larger than the sum of its proper divisors (182257).
137394743 is an equidigital number, since it uses as much as digits as its factorization.
137394743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182256.
The product of its digits is 190512, while the sum is 41.
The square root of 137394743 is about 11721.5503667390. The cubic root of 137394743 is about 516.0083214310.
The spelling of 137394743 in words is "one hundred thirty-seven million, three hundred ninety-four thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •