Base | Representation |
---|---|
bin | 111000011001000110… |
… | …0000111001011011101 |
3 | 102120120202010022110212 |
4 | 1300302030013023131 |
5 | 3441003341321341 |
6 | 131344425142205 |
7 | 11514666352304 |
oct | 1606214071335 |
9 | 376522108425 |
10 | 121101120221 |
11 | 473a4475034 |
12 | 1b57862a965 |
13 | b55c36abb3 |
14 | 5c0b69743b |
15 | 323b9ad5eb |
hex | 1c323072dd |
121101120221 has 4 divisors (see below), whose sum is σ = 121106143872. Its totient is φ = 121096096572.
The previous prime is 121101120163. The next prime is 121101120223. The reversal of 121101120221 is 122021101121.
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 121101120221 - 234 = 103921251037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121101120196 and 121101120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121101120223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2475491 + ... + 2523936.
It is an arithmetic number, because the mean of its divisors is an integer number (30276535968).
Almost surely, 2121101120221 is an apocalyptic number.
It is an amenable number.
121101120221 is a deficient number, since it is larger than the sum of its proper divisors (5023651).
121101120221 is an equidigital number, since it uses as much as digits as its factorization.
121101120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5023650.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121101120221 its reverse (122021101121), we get a palindrome (243122221342).
The spelling of 121101120221 in words is "one hundred twenty-one billion, one hundred one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •