Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …0111101110100001110001 |
3 | 1110022011022202111202021101 |
4 | 2201201302013232201301 |
5 | 2423331011142333243 |
6 | 35335153054524401 |
7 | 2223646035156451 |
oct | 241416207564161 |
9 | 43264282452241 |
10 | 11100110121073 |
11 | 359a591869666 |
12 | 12b3338506701 |
13 | 6269749abc9c |
14 | 2a536909dd61 |
15 | 143b153e754d |
hex | a18721ee871 |
11100110121073 has 2 divisors, whose sum is σ = 11100110121074. Its totient is φ = 11100110121072.
The previous prime is 11100110121031. The next prime is 11100110121091. The reversal of 11100110121073 is 37012101100111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8248797573184 + 2851312547889 = 2872072^2 + 1688583^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100110121073 - 213 = 11100110112881 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11100110121073.
It is not a weakly prime, because it can be changed into another prime (11100110121013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550055060536 + 5550055060537.
It is an arithmetic number, because the mean of its divisors is an integer number (5550055060537).
Almost surely, 211100110121073 is an apocalyptic number.
It is an amenable number.
11100110121073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100110121073 is an equidigital number, since it uses as much as digits as its factorization.
11100110121073 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 19.
Adding to 11100110121073 its reverse (37012101100111), we get a palindrome (48112211221184).
The spelling of 11100110121073 in words is "eleven trillion, one hundred billion, one hundred ten million, one hundred twenty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •