Base | Representation |
---|---|
bin | 10000011000010… |
… | …01101010110101 |
3 | 100120112210120021 |
4 | 20030021222311 |
5 | 240133344221 |
6 | 21345005141 |
7 | 3255623005 |
oct | 1014115265 |
9 | 316483507 |
10 | 137403061 |
11 | 70618a54 |
12 | 3a0237b1 |
13 | 2260b2b3 |
14 | 1436a005 |
15 | c0e2041 |
hex | 8309ab5 |
137403061 has 4 divisors (see below), whose sum is σ = 145485612. Its totient is φ = 129320512.
The previous prime is 137403053. The next prime is 137403109. The reversal of 137403061 is 160304731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 160304731 = 43 ⋅3728017.
It can be written as a sum of positive squares in 2 ways, for example, as 123076836 + 14326225 = 11094^2 + 3785^2 .
It is a cyclic number.
It is not a de Polignac number, because 137403061 - 23 = 137403053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137493061) 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, 4041250 + ... + 4041283.
It is an arithmetic number, because the mean of its divisors is an integer number (36371403).
Almost surely, 2137403061 is an apocalyptic number.
It is an amenable number.
137403061 is a deficient number, since it is larger than the sum of its proper divisors (8082551).
137403061 is an equidigital number, since it uses as much as digits as its factorization.
137403061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8082550.
The product of its (nonzero) digits is 1512, while the sum is 25.
The square root of 137403061 is about 11721.9051779137. The cubic root of 137403061 is about 516.0187344219.
Adding to 137403061 its reverse (160304731), we get a palindrome (297707792).
The spelling of 137403061 in words is "one hundred thirty-seven million, four hundred three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •