Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …011111110010100010001 |
3 | 10220011211121010202020001 |
4 | 100000221223332110101 |
5 | 121011213010133243 |
6 | 2201232512250001 |
7 | 142326153243223 |
oct | 20005153762421 |
9 | 3804747122201 |
10 | 1100211021073 |
11 | 39466249127a |
12 | 15928a540901 |
13 | 7c998720b08 |
14 | 3b371518413 |
15 | 1d944285a4d |
hex | 10029afe511 |
1100211021073 has 2 divisors, whose sum is σ = 1100211021074. Its totient is φ = 1100211021072.
The previous prime is 1100211021043. The next prime is 1100211021223. The reversal of 1100211021073 is 3701201120011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 886625625664 + 213585395409 = 941608^2 + 462153^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100211021073 - 29 = 1100211020561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100211021073.
It is not a weakly prime, because it can be changed into another prime (1100211021023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550105510536 + 550105510537.
It is an arithmetic number, because the mean of its divisors is an integer number (550105510537).
Almost surely, 21100211021073 is an apocalyptic number.
It is an amenable number.
1100211021073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100211021073 is an equidigital number, since it uses as much as digits as its factorization.
1100211021073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 1100211021073 its reverse (3701201120011), we get a palindrome (4801412141084).
The spelling of 1100211021073 in words is "one trillion, one hundred billion, two hundred eleven million, twenty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •