Base | Representation |
---|---|
bin | 111000010111000100… |
… | …1001000100000000101 |
3 | 102120102000101011001212 |
4 | 1300232021020200011 |
5 | 3440334001332331 |
6 | 131334002101205 |
7 | 11513213324522 |
oct | 1605611104005 |
9 | 376360334055 |
10 | 121033230341 |
11 | 4736a1153a1 |
12 | 1b55994a805 |
13 | b54b28a97a |
14 | 5c02664149 |
15 | 3235a4cd2b |
hex | 1c2e248805 |
121033230341 has 4 divisors (see below), whose sum is σ = 123847956672. Its totient is φ = 118218504012.
The previous prime is 121033230299. The next prime is 121033230391. The reversal of 121033230341 is 143032330121.
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 121033230341 - 218 = 121032968197 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 (121033230391) 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, 1407363101 + ... + 1407363186.
It is an arithmetic number, because the mean of its divisors is an integer number (30961989168).
Almost surely, 2121033230341 is an apocalyptic number.
It is an amenable number.
121033230341 is a deficient number, since it is larger than the sum of its proper divisors (2814726331).
121033230341 is an equidigital number, since it uses as much as digits as its factorization.
121033230341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2814726330.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 121033230341 its reverse (143032330121), we get a palindrome (264065560462).
The spelling of 121033230341 in words is "one hundred twenty-one billion, thirty-three million, two hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •