Base | Representation |
---|---|
bin | 1110010110101… |
… | …01011111101001 |
3 | 22101120120101210 |
4 | 13023111133221 |
5 | 221311142022 |
6 | 15540503333 |
7 | 2661325536 |
oct | 713253751 |
9 | 271516353 |
10 | 120412137 |
11 | 61a7346a |
12 | 343aab49 |
13 | 1bc3c6b1 |
14 | 11dc5d8d |
15 | a887a0c |
hex | 72d57e9 |
120412137 has 4 divisors (see below), whose sum is σ = 160549520. Its totient is φ = 80274756.
The previous prime is 120412111. The next prime is 120412151. The reversal of 120412137 is 731214021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 731214021 = 3 ⋅243738007.
It is not a de Polignac number, because 120412137 - 28 = 120411881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120412157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20068687 + ... + 20068692.
It is an arithmetic number, because the mean of its divisors is an integer number (40137380).
Almost surely, 2120412137 is an apocalyptic number.
It is an amenable number.
120412137 is a deficient number, since it is larger than the sum of its proper divisors (40137383).
120412137 is an equidigital number, since it uses as much as digits as its factorization.
120412137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40137382.
The product of its (nonzero) digits is 336, while the sum is 21.
The square root of 120412137 is about 10973.2464202714. The cubic root of 120412137 is about 493.8064458889.
Adding to 120412137 its reverse (731214021), we get a palindrome (851626158).
The spelling of 120412137 in words is "one hundred twenty million, four hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •