Base | Representation |
---|---|
bin | 1010000110001110001010… |
… | …1001000111111001101101 |
3 | 1110022100012022202001222102 |
4 | 2201203202221013321231 |
5 | 2423343342432031244 |
6 | 35340104253024445 |
7 | 2224043600216102 |
oct | 241434251077155 |
9 | 43270168661872 |
10 | 11101997923949 |
11 | 35a0370443929 |
12 | 12b3784785125 |
13 | 626bb5b31bca |
14 | 2a54a7ab0aa9 |
15 | 143bc5ee654e |
hex | a18e2a47e6d |
11101997923949 has 2 divisors, whose sum is σ = 11101997923950. Its totient is φ = 11101997923948.
The previous prime is 11101997923937. The next prime is 11101997923957. The reversal of 11101997923949 is 94932979910111.
It is a happy number.
11101997923949 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 can be written as a sum of positive squares in only one way, i.e., 10799077578025 + 302920345924 = 3286195^2 + 550382^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101997923949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101997922949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550998961974 + 5550998961975.
It is an arithmetic number, because the mean of its divisors is an integer number (5550998961975).
Almost surely, 211101997923949 is an apocalyptic number.
It is an amenable number.
11101997923949 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101997923949 is an equidigital number, since it uses as much as digits as its factorization.
11101997923949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9920232, while the sum is 65.
The spelling of 11101997923949 in words is "eleven trillion, one hundred one billion, nine hundred ninety-seven million, nine hundred twenty-three thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •