Base | Representation |
---|---|
bin | 1110011110010… |
… | …11100111100101 |
3 | 22110110210021201 |
4 | 13033023213211 |
5 | 222040422021 |
6 | 20014242501 |
7 | 3003024634 |
oct | 717134745 |
9 | 273423251 |
10 | 121420261 |
11 | 625a1926 |
12 | 347b6431 |
13 | 1c203511 |
14 | 121a951b |
15 | a9d6591 |
hex | 73cb9e5 |
121420261 has 8 divisors (see below), whose sum is σ = 124787520. Its totient is φ = 118077792.
The previous prime is 121420231. The next prime is 121420291. The reversal of 121420261 is 162024121.
It is an interprime number because it is at equal distance from previous prime (121420231) and next prime (121420291).
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 121420261 - 27 = 121420133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121420231) 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 in 7 ways as a sum of consecutive naturals, for example, 3960 + ... + 16078.
It is an arithmetic number, because the mean of its divisors is an integer number (15598440).
Almost surely, 2121420261 is an apocalyptic number.
It is an amenable number.
121420261 is a deficient number, since it is larger than the sum of its proper divisors (3367259).
121420261 is a wasteful number, since it uses less digits than its factorization.
121420261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12395.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 121420261 is about 11019.0862143828. The cubic root of 121420261 is about 495.1807128501.
Adding to 121420261 its reverse (162024121), we get a palindrome (283444382).
The spelling of 121420261 in words is "one hundred twenty-one million, four hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •