Base | Representation |
---|---|
bin | 1010000001100100111011… |
… | …1110100010111000010111 |
3 | 1110000201020211202110210112 |
4 | 2200121032332202320113 |
5 | 2421041442020201213 |
6 | 35235311152313235 |
7 | 2215220444340413 |
oct | 240311676427027 |
9 | 43021224673715 |
10 | 11022211100183 |
11 | 356a5478aa258 |
12 | 12a021824281b |
13 | 61c50bc1889a |
14 | 2a1699387d43 |
15 | 141aa65d5ea8 |
hex | a064efa2e17 |
11022211100183 has 2 divisors, whose sum is σ = 11022211100184. Its totient is φ = 11022211100182.
The previous prime is 11022211099981. The next prime is 11022211100209. The reversal of 11022211100183 is 38100111222011.
It is a happy number.
11022211100183 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (38100111222011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11022211100183 - 214 = 11022211083799 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022211106183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511105550091 + 5511105550092.
It is an arithmetic number, because the mean of its divisors is an integer number (5511105550092).
Almost surely, 211022211100183 is an apocalyptic number.
11022211100183 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022211100183 is an equidigital number, since it uses as much as digits as its factorization.
11022211100183 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 11022211100183 its reverse (38100111222011), we get a palindrome (49122322322194).
The spelling of 11022211100183 in words is "eleven trillion, twenty-two billion, two hundred eleven million, one hundred thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •