Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …0001110100101011101001 |
3 | 1110022020220111212021121102 |
4 | 2201202231301310223221 |
5 | 2423340033404341243 |
6 | 35335440251251145 |
7 | 2224012610461145 |
oct | 241425561645351 |
9 | 43266814767542 |
10 | 11101111012073 |
11 | 359aa55840905 |
12 | 12b3577749ab5 |
13 | 626aa416b894 |
14 | 2a5421da0225 |
15 | 143b732029b8 |
hex | a18adc74ae9 |
11101111012073 has 2 divisors, whose sum is σ = 11101111012074. Its totient is φ = 11101111012072.
The previous prime is 11101111012063. The next prime is 11101111012081. The reversal of 11101111012073 is 37021011110111.
It is a happy number.
11101111012073 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., 10886383500304 + 214727511769 = 3299452^2 + 463387^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101111012073 - 230 = 11100037270249 is a prime.
It is not a weakly prime, because it can be changed into another prime (11101111012063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550555506036 + 5550555506037.
It is an arithmetic number, because the mean of its divisors is an integer number (5550555506037).
Almost surely, 211101111012073 is an apocalyptic number.
It is an amenable number.
11101111012073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101111012073 is an equidigital number, since it uses as much as digits as its factorization.
11101111012073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42, while the sum is 20.
Adding to 11101111012073 its reverse (37021011110111), we get a palindrome (48122122122184).
The spelling of 11101111012073 in words is "eleven trillion, one hundred one billion, one hundred eleven million, twelve thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •