Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …001001111011111011111011 |
3 | 111010002222010121000100101100 |
4 | 112233112212021323323323 |
5 | 101102040213341010021 |
6 | 552412244322022443 |
7 | 30031364214052410 |
oct | 2657264611737373 |
9 | 433088117010340 |
10 | 100011101110011 |
11 | 29959519324463 |
12 | b2729a34a7a23 |
13 | 43a6010cb23b0 |
14 | 1a9a7c52c2107 |
15 | b867b9182626 |
hex | 5af5a627befb |
100011101110011 has 96 divisors (see below), whose sum is σ = 182621842003328. Its totient is φ = 51322010572800.
The previous prime is 100011101110007. The next prime is 100011101110051. The reversal of 100011101110011 is 110011101110001.
It is not a de Polignac number, because 100011101110011 - 22 = 100011101110007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100011101109975 and 100011101110002.
It is not an unprimeable number, because it can be changed into a prime (100011101110051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 299863335 + ... + 300196671.
Almost surely, 2100011101110011 is an apocalyptic number.
100011101110011 is a deficient number, since it is larger than the sum of its proper divisors (82610740893317).
100011101110011 is a wasteful number, since it uses less digits than its factorization.
100011101110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343301 (or 343298 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100011101110011 its reverse (110011101110001), we get a palindrome (210022202220012).
The spelling of 100011101110011 in words is "one hundred trillion, eleven billion, one hundred one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •