Base | Representation |
---|---|
bin | 1110011111011… |
… | …10101111011111 |
3 | 22110202002122002 |
4 | 13033232233133 |
5 | 222110023002 |
6 | 20021312515 |
7 | 3004164236 |
oct | 717565737 |
9 | 273662562 |
10 | 121564127 |
11 | 6268aa23 |
12 | 3486573b |
13 | 1c253b49 |
14 | 12205b1d |
15 | aa14002 |
hex | 73eebdf |
121564127 has 4 divisors (see below), whose sum is σ = 128714976. Its totient is φ = 114413280.
The previous prime is 121564099. The next prime is 121564133. The reversal of 121564127 is 721465121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 721465121 = 13 ⋅55497317.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121564127 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121564127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121564627) 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, 3575399 + ... + 3575432.
It is an arithmetic number, because the mean of its divisors is an integer number (32178744).
Almost surely, 2121564127 is an apocalyptic number.
121564127 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
121564127 is a deficient number, since it is larger than the sum of its proper divisors (7150849).
121564127 is an equidigital number, since it uses as much as digits as its factorization.
121564127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7150848.
The product of its digits is 3360, while the sum is 29.
The square root of 121564127 is about 11025.6123185971. The cubic root of 121564127 is about 495.3762089175.
The spelling of 121564127 in words is "one hundred twenty-one million, five hundred sixty-four thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •