Base | Representation |
---|---|
bin | 10110110000101010011011… |
… | …000110101001010010000011 |
3 | 111010102120110110122021101100 |
4 | 112300222123012221102003 |
5 | 101110024033130323021 |
6 | 552521452021105443 |
7 | 30041031552100404 |
oct | 2660523306512203 |
9 | 433376413567340 |
10 | 100101110011011 |
11 | 29993707a74a4a |
12 | b288323258283 |
13 | 43b16568ccc25 |
14 | 1aa0cc34599ab |
15 | b88cd61bb626 |
hex | 5b0a9b1a9483 |
100101110011011 has 96 divisors (see below), whose sum is σ = 160218912679488. Its totient is φ = 59950974320640.
The previous prime is 100101110010971. The next prime is 100101110011027. The reversal of 100101110011011 is 110110011101001.
It is not a de Polignac number, because 100101110011011 - 213 = 100101110002819 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 = 100101110010984 and 100101110011002.
It is not an unprimeable number, because it can be changed into a prime (100101110061011) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3816706680 + ... + 3816732906.
It is an arithmetic number, because the mean of its divisors is an integer number (1668947007078).
Almost surely, 2100101110011011 is an apocalyptic number.
100101110011011 is a deficient number, since it is larger than the sum of its proper divisors (60117802668477).
100101110011011 is a wasteful number, since it uses less digits than its factorization.
100101110011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39061 (or 39058 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100101110011011 its reverse (110110011101001), we get a palindrome (210211121112012).
The spelling of 100101110011011 in words is "one hundred trillion, one hundred one billion, one hundred ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •