Base | Representation |
---|---|
bin | 10110101111101010… |
… | …10011111000011101 |
3 | 1011112000011122011102 |
4 | 23113311103320131 |
5 | 200002004323401 |
6 | 5335404202445 |
7 | 611412611312 |
oct | 132765237035 |
9 | 34460148142 |
10 | 12211011101 |
11 | 51a6885413 |
12 | 2449539425 |
13 | 11c7aa5973 |
14 | 83ba68d09 |
15 | 4b705256b |
hex | 2d7d53e1d |
12211011101 has 2 divisors, whose sum is σ = 12211011102. Its totient is φ = 12211011100.
The previous prime is 12211011097. The next prime is 12211011103. The reversal of 12211011101 is 10111011221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7518624100 + 4692387001 = 86710^2 + 68501^2 .
It is an emirp because it is prime and its reverse (10111011221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12211011101 - 22 = 12211011097 is a prime.
Together with 12211011103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211011103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105505550 + 6105505551.
It is an arithmetic number, because the mean of its divisors is an integer number (6105505551).
Almost surely, 212211011101 is an apocalyptic number.
It is an amenable number.
12211011101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211011101 is an equidigital number, since it uses as much as digits as its factorization.
12211011101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12211011101 its reverse (10111011221), we get a palindrome (22322022322).
It can be divided in two parts, 1221 and 1011101, that multiplied together give a palindrome (1234554321).
The spelling of 12211011101 in words is "twelve billion, two hundred eleven million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •