Base | Representation |
---|---|
bin | 111000100000101010… |
… | …1110110001111010011 |
3 | 102121020110110112102221 |
4 | 1301001111312033103 |
5 | 3442013431034030 |
6 | 131425545521511 |
7 | 11524204201216 |
oct | 1610125661723 |
9 | 377213415387 |
10 | 121355330515 |
11 | 47514a13a91 |
12 | 1b6297a3297 |
13 | b59cc25aa3 |
14 | 5c3334b77d |
15 | 3253e74e7a |
hex | 1c415763d3 |
121355330515 has 4 divisors (see below), whose sum is σ = 145626396624. Its totient is φ = 97084264408.
The previous prime is 121355330513. The next prime is 121355330533. The reversal of 121355330515 is 515033553121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 515033553121 = 109 ⋅4725078469.
It is a cyclic number.
It is not a de Polignac number, because 121355330515 - 21 = 121355330513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121355330513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12135533047 + ... + 12135533056.
It is an arithmetic number, because the mean of its divisors is an integer number (36406599156).
Almost surely, 2121355330515 is an apocalyptic number.
121355330515 is a deficient number, since it is larger than the sum of its proper divisors (24271066109).
121355330515 is an equidigital number, since it uses as much as digits as its factorization.
121355330515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24271066108.
The product of its (nonzero) digits is 33750, while the sum is 34.
Adding to 121355330515 its reverse (515033553121), we get a palindrome (636388883636).
The spelling of 121355330515 in words is "one hundred twenty-one billion, three hundred fifty-five million, three hundred thirty thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •