Base | Representation |
---|---|
bin | 10000000000110000110… |
… | …110011011001100011111 |
3 | 10220012010222021112111222 |
4 | 100000300312123030133 |
5 | 121011434241420221 |
6 | 2201252444203555 |
7 | 142332142615016 |
oct | 20006066331437 |
9 | 3805128245458 |
10 | 1100331201311 |
11 | 394714306491 |
12 | 1593028395bb |
13 | 7c9b75aba94 |
14 | 3b38347da7d |
15 | 1d94eac49ab |
hex | 10030d9b31f |
1100331201311 has 24 divisors (see below), whose sum is σ = 1206788805120. Its totient is φ = 1002016828800.
The previous prime is 1100331201301. The next prime is 1100331201313. The reversal of 1100331201311 is 1131021330011.
It is not a de Polignac number, because 1100331201311 - 26 = 1100331201247 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1100331201311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100331201313) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 87245396 + ... + 87258006.
It is an arithmetic number, because the mean of its divisors is an integer number (50282866880).
Almost surely, 21100331201311 is an apocalyptic number.
1100331201311 is a deficient number, since it is larger than the sum of its proper divisors (106457603809).
1100331201311 is a wasteful number, since it uses less digits than its factorization.
1100331201311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22415 (or 22398 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1100331201311 its reverse (1131021330011), we get a palindrome (2231352531322).
The spelling of 1100331201311 in words is "one trillion, one hundred billion, three hundred thirty-one million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •