Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …01110110100100100100 |
3 | 10112201000101110210212011 |
4 | 32210112031312210210 |
5 | 112400223112010431 |
6 | 2043522105404004 |
7 | 132220123351111 |
oct | 16442615664444 |
9 | 3481011423764 |
10 | 1001100110116 |
11 | 356622a05a07 |
12 | 14202a499604 |
13 | 73532187682 |
14 | 3664c5b3908 |
15 | 1b09311ecb1 |
hex | e916376924 |
1001100110116 has 12 divisors (see below), whose sum is σ = 1771609746060. Its totient is φ = 494925896960.
The previous prime is 1001100110113. The next prime is 1001100110117. The reversal of 1001100110116 is 6110110011001.
It can be written as a sum of positive squares in 2 ways, for example, as 339301590016 + 661798520100 = 582496^2 + 813510^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1001100110096 and 1001100110105.
It is not an unprimeable number, because it can be changed into a prime (1001100110113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1406039125 + ... + 1406039836.
It is an arithmetic number, because the mean of its divisors is an integer number (147634145505).
Almost surely, 21001100110116 is an apocalyptic number.
It is an amenable number.
1001100110116 is a deficient number, since it is larger than the sum of its proper divisors (770509635944).
1001100110116 is a wasteful number, since it uses less digits than its factorization.
1001100110116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2812079054 (or 2812079052 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 1001100110116 its reverse (6110110011001), we get a palindrome (7111210121117).
The spelling of 1001100110116 in words is "one trillion, one billion, one hundred million, one hundred ten thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •