Base | Representation |
---|---|
bin | 111000100010101010… |
… | …1101101111001111001 |
3 | 102121102010200021200001 |
4 | 1301011111231321321 |
5 | 3442133113431431 |
6 | 131440343313001 |
7 | 11525650262314 |
oct | 1610525557171 |
9 | 377363607601 |
10 | 121422405241 |
11 | 47549867245 |
12 | 1b64814b761 |
13 | b5b0aabc87 |
14 | 5c3c20b97b |
15 | 3259cc3e61 |
hex | 1c4556de79 |
121422405241 has 4 divisors (see below), whose sum is σ = 121644384592. Its totient is φ = 121200425892.
The previous prime is 121422405229. The next prime is 121422405263. The reversal of 121422405241 is 142504224121.
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, and also an emirpimes, since its reverse is a distinct semiprime: 142504224121 = 7 ⋅20357746303.
It is a cyclic number.
It is not a de Polignac number, because 121422405241 - 213 = 121422397049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121422408241) 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, 110988855 + ... + 110989948.
It is an arithmetic number, because the mean of its divisors is an integer number (30411096148).
Almost surely, 2121422405241 is an apocalyptic number.
It is an amenable number.
121422405241 is a deficient number, since it is larger than the sum of its proper divisors (221979351).
121422405241 is an equidigital number, since it uses as much as digits as its factorization.
121422405241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221979350.
The product of its (nonzero) digits is 5120, while the sum is 28.
Adding to 121422405241 its reverse (142504224121), we get a palindrome (263926629362).
The spelling of 121422405241 in words is "one hundred twenty-one billion, four hundred twenty-two million, four hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •