Base | Representation |
---|---|
bin | 10110110000101001011110… |
… | …111010001001001110010011 |
3 | 111010102110212002022112022021 |
4 | 112300221132322021032103 |
5 | 101110020001111213021 |
6 | 552521203503152311 |
7 | 30040664540023363 |
oct | 2660513672111623 |
9 | 433373762275267 |
10 | 100100100101011 |
11 | 299932399a268a |
12 | b2880a0ba5697 |
13 | 43b152560314a |
14 | 1aa0c2928c9a3 |
15 | b88c776cdc41 |
hex | 5b0a5ee89393 |
100100100101011 has 4 divisors (see below), whose sum is σ = 100100408417800. Its totient is φ = 100099791784224.
The previous prime is 100100100100951. The next prime is 100100100101059. The reversal of 100100100101011 is 110101001001001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100100100101011 - 217 = 100100099969939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100100100100985 and 100100100101003.
It is not an unprimeable number, because it can be changed into a prime (100100190101011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153670881 + ... + 154320898.
It is an arithmetic number, because the mean of its divisors is an integer number (25025102104450).
Almost surely, 2100100100101011 is an apocalyptic number.
100100100101011 is a deficient number, since it is larger than the sum of its proper divisors (308316789).
100100100101011 is an equidigital number, since it uses as much as digits as its factorization.
100100100101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308316788.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100100100101011 its reverse (110101001001001), we get a palindrome (210201101102012).
The spelling of 100100100101011 in words is "one hundred trillion, one hundred billion, one hundred million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •