Base | Representation |
---|---|
bin | 1110011100001… |
… | …11111001100001 |
3 | 22102221200210101 |
4 | 13032013321201 |
5 | 222003033011 |
6 | 20004302401 |
7 | 3000461146 |
oct | 716077141 |
9 | 272850711 |
10 | 121142881 |
11 | 62422492 |
12 | 346a1a01 |
13 | 1c1371a2 |
14 | 121363cd |
15 | a97e2c1 |
hex | 7387e61 |
121142881 has 4 divisors (see below), whose sum is σ = 121353412. Its totient is φ = 120932352.
The previous prime is 121142873. The next prime is 121142929. The reversal of 121142881 is 188241121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 73256481 + 47886400 = 8559^2 + 6920^2 .
It is a 5-Lehmer number, since φ(121142881) divides (121142881-1)5.
It is a cyclic number.
It is not a de Polignac number, because 121142881 - 23 = 121142873 is a prime.
It is a super-3 number, since 3×1211428813 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121142821) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104400 + ... + 105553.
It is an arithmetic number, because the mean of its divisors is an integer number (30338353).
Almost surely, 2121142881 is an apocalyptic number.
It is an amenable number.
121142881 is a deficient number, since it is larger than the sum of its proper divisors (210531).
121142881 is an equidigital number, since it uses as much as digits as its factorization.
121142881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210530.
The product of its digits is 1024, while the sum is 28.
The square root of 121142881 is about 11006.4926747806. The cubic root of 121142881 is about 494.8033514698.
The spelling of 121142881 in words is "one hundred twenty-one million, one hundred forty-two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •