Base | Representation |
---|---|
bin | 1010001100100100100110… |
… | …1000111110010001000101 |
3 | 1110200202210211202220001022 |
4 | 2203021021220332101011 |
5 | 2432140313112321013 |
6 | 35502150331440525 |
7 | 2234655340455524 |
oct | 243111150762105 |
9 | 43622724686038 |
10 | 11211100120133 |
11 | 3632667821711 |
12 | 13109528b6145 |
13 | 634282323c44 |
14 | 2aa89794a4bb |
15 | 14695e398008 |
hex | a3249a3e445 |
11211100120133 has 2 divisors, whose sum is σ = 11211100120134. Its totient is φ = 11211100120132.
The previous prime is 11211100120117. The next prime is 11211100120141. The reversal of 11211100120133 is 33102100111211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7776390349924 + 3434709770209 = 2788618^2 + 1853297^2 .
It is a cyclic number.
It is not a de Polignac number, because 11211100120133 - 24 = 11211100120117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11211100120153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605550060066 + 5605550060067.
It is an arithmetic number, because the mean of its divisors is an integer number (5605550060067).
Almost surely, 211211100120133 is an apocalyptic number.
It is an amenable number.
11211100120133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211100120133 is an equidigital number, since it uses as much as digits as its factorization.
11211100120133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 11211100120133 its reverse (33102100111211), we get a palindrome (44313200231344).
The spelling of 11211100120133 in words is "eleven trillion, two hundred eleven billion, one hundred million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •