Base | Representation |
---|---|
bin | 111000111010001011… |
… | …0000000111000000101 |
3 | 102200110002120122220112 |
4 | 1301310112000320011 |
5 | 4000242004341401 |
6 | 132050514042405 |
7 | 11554334314553 |
oct | 1616426007005 |
9 | 380402518815 |
10 | 122211012101 |
11 | 47913a26252 |
12 | 1b828279405 |
13 | b6a82a3159 |
14 | 5cb4c4cbd3 |
15 | 32a414a3bb |
hex | 1c74580e05 |
122211012101 has 4 divisors (see below), whose sum is σ = 123020356704. Its totient is φ = 121401667500.
The previous prime is 122211012067. The next prime is 122211012107. The reversal of 122211012101 is 101210112221.
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 122211012101 - 210 = 122211011077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122211012107) 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, 404672075 + ... + 404672376.
It is an arithmetic number, because the mean of its divisors is an integer number (30755089176).
Almost surely, 2122211012101 is an apocalyptic number.
It is an amenable number.
122211012101 is a deficient number, since it is larger than the sum of its proper divisors (809344603).
122211012101 is an equidigital number, since it uses as much as digits as its factorization.
122211012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809344602.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122211012101 its reverse (101210112221), we get a palindrome (223421124322).
It can be divided in two parts, 12221 and 1012101, that multiplied together give a palindrome (12368886321).
The spelling of 122211012101 in words is "one hundred twenty-two billion, two hundred eleven million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •