Base | Representation |
---|---|
bin | 11011100010010000000110… |
… | …001010001110011101111011 |
3 | 120212210010211222211011001220 |
4 | 123202100012022032131323 |
5 | 111333104322303101021 |
6 | 1105321010522043123 |
7 | 34336154463152256 |
oct | 3342200612163573 |
9 | 525703758734056 |
10 | 121101001222011 |
11 | 3564a712103108 |
12 | 116ba2283494a3 |
13 | 5275a1077c3b5 |
14 | 21c94694c209d |
15 | e001ace79cc6 |
hex | 6e240628e77b |
121101001222011 has 4 divisors (see below), whose sum is σ = 161468001629352. Its totient is φ = 80734000814672.
The previous prime is 121101001222001. The next prime is 121101001222057. The reversal of 121101001222011 is 110222100101121.
It is a happy number.
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 121101001222011 - 210 = 121101001220987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121101001222001) 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, 20183500203666 + ... + 20183500203671.
It is an arithmetic number, because the mean of its divisors is an integer number (40367000407338).
Almost surely, 2121101001222011 is an apocalyptic number.
121101001222011 is a deficient number, since it is larger than the sum of its proper divisors (40367000407341).
121101001222011 is an equidigital number, since it uses as much as digits as its factorization.
121101001222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40367000407340.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 121101001222011 its reverse (110222100101121), we get a palindrome (231323101323132).
The spelling of 121101001222011 in words is "one hundred twenty-one trillion, one hundred one billion, one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •