Base | Representation |
---|---|
bin | 111000100000100101… |
… | …0110000001111000101 |
3 | 102121020020222210011210 |
4 | 1301001022300033011 |
5 | 3442012210003331 |
6 | 131425403322033 |
7 | 11524140366453 |
oct | 1610112601705 |
9 | 377206883153 |
10 | 121352422341 |
11 | 47513308037 |
12 | 1b628820319 |
13 | b59c448187 |
14 | 5c32bd19d3 |
15 | 3253a9d446 |
hex | 1c412b03c5 |
121352422341 has 4 divisors (see below), whose sum is σ = 161803229792. Its totient is φ = 80901614892.
The previous prime is 121352422309. The next prime is 121352422361. The reversal of 121352422341 is 143224253121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 121352422341 - 25 = 121352422309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121352422299 and 121352422308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121352422361) 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, 20225403721 + ... + 20225403726.
It is an arithmetic number, because the mean of its divisors is an integer number (40450807448).
Almost surely, 2121352422341 is an apocalyptic number.
It is an amenable number.
121352422341 is a deficient number, since it is larger than the sum of its proper divisors (40450807451).
121352422341 is an equidigital number, since it uses as much as digits as its factorization.
121352422341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40450807450.
The product of its digits is 11520, while the sum is 30.
Adding to 121352422341 its reverse (143224253121), we get a palindrome (264576675462).
The spelling of 121352422341 in words is "one hundred twenty-one billion, three hundred fifty-two million, four hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •