Base | Representation |
---|---|
bin | 111000101100101001… |
… | …0100000000010100101 |
3 | 102122021110110212021002 |
4 | 1301121102200002211 |
5 | 3443324304400331 |
6 | 131533501203045 |
7 | 11540153220263 |
oct | 1613122400245 |
9 | 378243425232 |
10 | 121757106341 |
11 | 47700792122 |
12 | 1b720260485 |
13 | b635239770 |
14 | 5c70855433 |
15 | 32793899cb |
hex | 1c594a00a5 |
121757106341 has 4 divisors (see below), whose sum is σ = 131123037612. Its totient is φ = 112391175072.
The previous prime is 121757106319. The next prime is 121757106349. The reversal of 121757106341 is 143601757121.
It is a happy number.
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 40913557441 + 80843548900 = 202271^2 + 284330^2 .
It is a cyclic number.
It is not a de Polignac number, because 121757106341 - 230 = 120683364517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121757106295 and 121757106304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121757106349) 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, 4682965616 + ... + 4682965641.
It is an arithmetic number, because the mean of its divisors is an integer number (32780759403).
Almost surely, 2121757106341 is an apocalyptic number.
It is an amenable number.
121757106341 is a deficient number, since it is larger than the sum of its proper divisors (9365931271).
121757106341 is an equidigital number, since it uses as much as digits as its factorization.
121757106341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9365931270.
The product of its (nonzero) digits is 35280, while the sum is 38.
The spelling of 121757106341 in words is "one hundred twenty-one billion, seven hundred fifty-seven million, one hundred six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •