Base | Representation |
---|---|
bin | 1110010111000… |
… | …00010000110001 |
3 | 22101122210220021 |
4 | 13023200100301 |
5 | 221314044431 |
6 | 15541443441 |
7 | 2661601243 |
oct | 713402061 |
9 | 271583807 |
10 | 120456241 |
11 | 61aa3614 |
12 | 34410581 |
13 | 1bc567a9 |
14 | 11dd8093 |
15 | a895b11 |
hex | 72e0431 |
120456241 has 4 divisors (see below), whose sum is σ = 121067892. Its totient is φ = 119844592.
The previous prime is 120456223. The next prime is 120456307. The reversal of 120456241 is 142654021.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 142654021 = 17 ⋅8391413.
It can be written as a sum of positive squares in 2 ways, for example, as 114575616 + 5880625 = 10704^2 + 2425^2 .
It is a cyclic number.
It is not a de Polignac number, because 120456241 - 29 = 120455729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120456841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 305530 + ... + 305923.
It is an arithmetic number, because the mean of its divisors is an integer number (30266973).
Almost surely, 2120456241 is an apocalyptic number.
It is an amenable number.
120456241 is a deficient number, since it is larger than the sum of its proper divisors (611651).
120456241 is an equidigital number, since it uses as much as digits as its factorization.
120456241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611650.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 120456241 is about 10975.2558512319. The cubic root of 120456241 is about 493.8667282423.
The spelling of 120456241 in words is "one hundred twenty million, four hundred fifty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •