Base | Representation |
---|---|
bin | 1110011010010… |
… | …10010101000101 |
3 | 22102110212212002 |
4 | 13031022111011 |
5 | 221422000233 |
6 | 15555035045 |
7 | 2665361000 |
oct | 715122505 |
9 | 272425762 |
10 | 120890693 |
11 | 6226aa70 |
12 | 3459ba85 |
13 | 1c079471 |
14 | 120ac537 |
15 | a92e6e8 |
hex | 734a545 |
120890693 has 24 divisors (see below), whose sum is σ = 154660800. Its totient is φ = 93674280.
The previous prime is 120890687. The next prime is 120890699. The reversal of 120890693 is 396098021.
It is an interprime number because it is at equal distance from previous prime (120890687) and next prime (120890699).
It is not a de Polignac number, because 120890693 - 216 = 120825157 is a prime.
It is a super-3 number, since 3×1208906933 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120890699) 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 23 ways as a sum of consecutive naturals, for example, 675278 + ... + 675456.
It is an arithmetic number, because the mean of its divisors is an integer number (6444200).
Almost surely, 2120890693 is an apocalyptic number.
It is an amenable number.
120890693 is a deficient number, since it is larger than the sum of its proper divisors (33770107).
120890693 is an frugal number, since it uses more digits than its factorization.
120890693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390 (or 197 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 120890693 is about 10995.0303774023. The cubic root of 120890693 is about 494.4597622696.
The spelling of 120890693 in words is "one hundred twenty million, eight hundred ninety thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •