Base | Representation |
---|---|
bin | 111000110111011111… |
… | …0101011110000101101 |
3 | 102200012211020002112120 |
4 | 1301232332223300231 |
5 | 4000100434311341 |
6 | 132033541023153 |
7 | 11552162313450 |
oct | 1615676536055 |
9 | 380184202476 |
10 | 122121010221 |
11 | 47878143531 |
12 | 1b8020b4ab9 |
13 | b6927503c2 |
14 | 5ca6d01497 |
15 | 329b2bd066 |
hex | 1c6efabc2d |
122121010221 has 16 divisors (see below), whose sum is σ = 186760969344. Its totient is φ = 69531505344.
The previous prime is 122121010217. The next prime is 122121010261. The reversal of 122121010221 is 122010121221.
It is not a de Polignac number, because 122121010221 - 22 = 122121010217 is a prime.
It is a super-2 number, since 2×1221210102212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122121010221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122121010201) 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 15 ways as a sum of consecutive naturals, for example, 10491090 + ... + 10502723.
It is an arithmetic number, because the mean of its divisors is an integer number (11672560584).
Almost surely, 2122121010221 is an apocalyptic number.
It is an amenable number.
122121010221 is a deficient number, since it is larger than the sum of its proper divisors (64639959123).
122121010221 is a wasteful number, since it uses less digits than its factorization.
122121010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20994100.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122121010221 its reverse (122010121221), we get a palindrome (244131131442).
The spelling of 122121010221 in words is "one hundred twenty-two billion, one hundred twenty-one million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •