Base | Representation |
---|---|
bin | 1110010101100… |
… | …11111010011101 |
3 | 22101022120201102 |
4 | 13022303322131 |
5 | 221242241324 |
6 | 15533522445 |
7 | 2660213531 |
oct | 712637235 |
9 | 271276642 |
10 | 120274589 |
11 | 6198a096 |
12 | 34343425 |
13 | 1bbc1bc6 |
14 | 11d8bbc1 |
15 | a85bdae |
hex | 72b3e9d |
120274589 has 2 divisors, whose sum is σ = 120274590. Its totient is φ = 120274588.
The previous prime is 120274559. The next prime is 120274619. The reversal of 120274589 is 985472021.
It is a balanced prime because it is at equal distance from previous prime (120274559) and next prime (120274619).
It can be written as a sum of positive squares in only one way, i.e., 111619225 + 8655364 = 10565^2 + 2942^2 .
It is a cyclic number.
It is not a de Polignac number, because 120274589 - 220 = 119226013 is a prime.
It is a Chen prime.
It is equal to p6856490 and since 120274589 and 6856490 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120274529) 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, 60137294 + 60137295.
It is an arithmetic number, because the mean of its divisors is an integer number (60137295).
Almost surely, 2120274589 is an apocalyptic number.
It is an amenable number.
120274589 is a deficient number, since it is larger than the sum of its proper divisors (1).
120274589 is an equidigital number, since it uses as much as digits as its factorization.
120274589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 120274589 is about 10966.9772043166. The cubic root of 120274589 is about 493.6183475519.
The spelling of 120274589 in words is "one hundred twenty million, two hundred seventy-four thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •