Base | Representation |
---|---|
bin | 111000100000010001… |
… | …1000011100000001101 |
3 | 102121012112102001200021 |
4 | 1301000203003200031 |
5 | 3442002023444001 |
6 | 131424352302141 |
7 | 11523653054020 |
oct | 1610043034015 |
9 | 377175361607 |
10 | 121342015501 |
11 | 4750844a243 |
12 | 1b625241951 |
13 | b59a243395 |
14 | 5c316831b7 |
15 | 3252be4ba1 |
hex | 1c408c380d |
121342015501 has 4 divisors (see below), whose sum is σ = 138676589152. Its totient is φ = 104007441852.
The previous prime is 121342015463. The next prime is 121342015567. The reversal of 121342015501 is 105510243121.
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 a cyclic number.
It is not a de Polignac number, because 121342015501 - 213 = 121342007309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121342015001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8667286815 + ... + 8667286828.
It is an arithmetic number, because the mean of its divisors is an integer number (34669147288).
Almost surely, 2121342015501 is an apocalyptic number.
It is an amenable number.
121342015501 is a deficient number, since it is larger than the sum of its proper divisors (17334573651).
121342015501 is an equidigital number, since it uses as much as digits as its factorization.
121342015501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17334573650.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 121342015501 its reverse (105510243121), we get a palindrome (226852258622).
The spelling of 121342015501 in words is "one hundred twenty-one billion, three hundred forty-two million, fifteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •