Base | Representation |
---|---|
bin | 1110010101101… |
… | …00000100010101 |
3 | 22101022121120211 |
4 | 13022310010111 |
5 | 221242301341 |
6 | 15533525421 |
7 | 2660215423 |
oct | 712640425 |
9 | 271277524 |
10 | 120275221 |
11 | 6198a610 |
12 | 34343871 |
13 | 1bbc2291 |
14 | 11d8c113 |
15 | a85c181 |
hex | 72b4115 |
120275221 has 8 divisors (see below), whose sum is σ = 138927744. Its totient is φ = 102909120.
The previous prime is 120275213. The next prime is 120275227. The reversal of 120275221 is 122572021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120275221 - 23 = 120275213 is a prime.
It is a super-2 number, since 2×1202752212 = 28932257573197682, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120275192 and 120275201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120275227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 321405 + ... + 321778.
It is an arithmetic number, because the mean of its divisors is an integer number (17365968).
Almost surely, 2120275221 is an apocalyptic number.
120275221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120275221 is a deficient number, since it is larger than the sum of its proper divisors (18652523).
120275221 is a wasteful number, since it uses less digits than its factorization.
120275221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 643211.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 120275221 is about 10967.0060180525. The cubic root of 120275221 is about 493.6192121465.
The spelling of 120275221 in words is "one hundred twenty million, two hundred seventy-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •