Base | Representation |
---|---|
bin | 1110011100001… |
… | …01100110111101 |
3 | 22102221012220222 |
4 | 13032011212331 |
5 | 222002233001 |
6 | 20004151125 |
7 | 3000421616 |
oct | 716054675 |
9 | 272835828 |
10 | 121133501 |
11 | 62416435 |
12 | 346984a5 |
13 | 1c132b38 |
14 | 12132c0d |
15 | a97b61b |
hex | 73859bd |
121133501 has 4 divisors (see below), whose sum is σ = 121307004. Its totient is φ = 120960000.
The previous prime is 121133497. The next prime is 121133533. The reversal of 121133501 is 105331121.
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 113848900 + 7284601 = 10670^2 + 2699^2 .
It is a cyclic number.
It is not a de Polignac number, because 121133501 - 22 = 121133497 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 121133501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121133591) 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, 85700 + ... + 87101.
It is an arithmetic number, because the mean of its divisors is an integer number (30326751).
Almost surely, 2121133501 is an apocalyptic number.
It is an amenable number.
121133501 is a deficient number, since it is larger than the sum of its proper divisors (173503).
121133501 is an equidigital number, since it uses as much as digits as its factorization.
121133501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173502.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 121133501 is about 11006.0665544053. The cubic root of 121133501 is about 494.7905803927.
Adding to 121133501 its reverse (105331121), we get a palindrome (226464622).
The spelling of 121133501 in words is "one hundred twenty-one million, one hundred thirty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •