Base | Representation |
---|---|
bin | 111000011001011000… |
… | …1110011110001101101 |
3 | 102120121102201101000212 |
4 | 1300302301303301231 |
5 | 3441013404032341 |
6 | 131345421032205 |
7 | 11515146350636 |
oct | 1606261636155 |
9 | 376542641025 |
10 | 121111002221 |
11 | 473aa004580 |
12 | 1b57b9b5665 |
13 | b56141ab31 |
14 | 5c0cb0a88d |
15 | 323c7b15eb |
hex | 1c32c73c6d |
121111002221 has 8 divisors (see below), whose sum is σ = 132499668000. Its totient is φ = 109785432240.
The previous prime is 121111002211. The next prime is 121111002269. The reversal of 121111002221 is 122200111121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-121111002221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121111002196 and 121111002205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121111002211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15769931 + ... + 15777608.
It is an arithmetic number, because the mean of its divisors is an integer number (16562458500).
Almost surely, 2121111002221 is an apocalyptic number.
121111002221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121111002221 is a deficient number, since it is larger than the sum of its proper divisors (11388665779).
121111002221 is a wasteful number, since it uses less digits than its factorization.
121111002221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31547899.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121111002221 its reverse (122200111121), we get a palindrome (243311113342).
The spelling of 121111002221 in words is "one hundred twenty-one billion, one hundred eleven million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •