Base | Representation |
---|---|
bin | 10110110000101001011110… |
… | …111101111111100011111011 |
3 | 111010102110212011012210101122 |
4 | 112300221132331333203323 |
5 | 101110020001341010021 |
6 | 552521203540535455 |
7 | 30040664551425152 |
oct | 2660513675774373 |
9 | 433373764183348 |
10 | 100100101110011 |
11 | 2999323a521772 |
12 | b2880a13b158b |
13 | 43b15258974a2 |
14 | 1aa0c29472599 |
15 | b88c7782cbab |
hex | 5b0a5ef7f8fb |
100100101110011 has 8 divisors (see below), whose sum is σ = 100775237897040. Its totient is φ = 99426577554432.
The previous prime is 100100101109947. The next prime is 100100101110041. The reversal of 100100101110011 is 110011101001001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100100101110011 - 26 = 100100101109947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100100101110041) 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 7 ways as a sum of consecutive naturals, for example, 403183346 + ... + 403431543.
It is an arithmetic number, because the mean of its divisors is an integer number (12596904737130).
Almost surely, 2100100101110011 is an apocalyptic number.
100100101110011 is a deficient number, since it is larger than the sum of its proper divisors (675136787029).
100100101110011 is an equidigital number, since it uses as much as digits as its factorization.
100100101110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 806615725.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100100101110011 its reverse (110011101001001), we get a palindrome (210111202111012).
The spelling of 100100101110011 in words is "one hundred trillion, one hundred billion, one hundred one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •