Base | Representation |
---|---|
bin | 1110010110101… |
… | …01110100011111 |
3 | 22101120122020012 |
4 | 13023111310133 |
5 | 221311212341 |
6 | 15540513435 |
7 | 2661332453 |
oct | 713256437 |
9 | 271518205 |
10 | 120413471 |
11 | 61a74472 |
12 | 343ab87b |
13 | 1bc40199 |
14 | 11dc6663 |
15 | a8880eb |
hex | 72d5d1f |
120413471 has 2 divisors, whose sum is σ = 120413472. Its totient is φ = 120413470.
The previous prime is 120413417. The next prime is 120413521. The reversal of 120413471 is 174314021.
It is a happy number.
Together with previous prime (120413417) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120413471 - 210 = 120412447 is a prime.
It is a super-3 number, since 3×1204134713 (a number of 25 digits) contains 333 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120413411) 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 as a sum of consecutive naturals, namely, 60206735 + 60206736.
It is an arithmetic number, because the mean of its divisors is an integer number (60206736).
Almost surely, 2120413471 is an apocalyptic number.
120413471 is a deficient number, since it is larger than the sum of its proper divisors (1).
120413471 is an equidigital number, since it uses as much as digits as its factorization.
120413471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 120413471 is about 10973.3072043026. The cubic root of 120413471 is about 493.8082694464.
Adding to 120413471 its reverse (174314021), we get a palindrome (294727492).
The spelling of 120413471 in words is "one hundred twenty million, four hundred thirteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •