Base | Representation |
---|---|
bin | 11011100101100101011000… |
… | …001001110011110000100011 |
3 | 120220121000222000110002020121 |
4 | 123211211120021303300203 |
5 | 111400332330042023021 |
6 | 1110014123121221111 |
7 | 34361542520455552 |
oct | 3345453011636043 |
9 | 526530860402217 |
10 | 121330010111011 |
11 | 3572884a705a39 |
12 | 1173669aa91797 |
13 | 52914a8a19440 |
14 | 21d6592135d99 |
15 | e06113000741 |
hex | 6e5958273c23 |
121330010111011 has 4 divisors (see below), whose sum is σ = 130663087811872. Its totient is φ = 111996932410152.
The previous prime is 121330010110957. The next prime is 121330010111069. The reversal of 121330010111011 is 110111010033121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121330010111011 - 215 = 121330010078243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121330010111071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4666538850411 + ... + 4666538850436.
It is an arithmetic number, because the mean of its divisors is an integer number (32665771952968).
Almost surely, 2121330010111011 is an apocalyptic number.
121330010111011 is a deficient number, since it is larger than the sum of its proper divisors (9333077700861).
121330010111011 is an equidigital number, since it uses as much as digits as its factorization.
121330010111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9333077700860.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 121330010111011 its reverse (110111010033121), we get a palindrome (231441020144132).
The spelling of 121330010111011 in words is "one hundred twenty-one trillion, three hundred thirty billion, ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •