Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …110010001100011011001011 |
3 | 111010002221220022110021200221 |
4 | 112233112200302030123023 |
5 | 101102040022304000021 |
6 | 552412231342410511 |
7 | 30031362041121136 |
oct | 2657264062143313 |
9 | 433087808407627 |
10 | 100011011000011 |
11 | 29959482478491 |
12 | b272979290a37 |
13 | 43a5cc8422377 |
14 | 1a9a7b734721d |
15 | b867b12d3241 |
hex | 5af5a0c8c6cb |
100011011000011 has 8 divisors (see below), whose sum is σ = 100442121867360. Its totient is φ = 99579916193472.
The previous prime is 100011010999993. The next prime is 100011011000023. The reversal of 100011011000011 is 110000110110001.
It is a happy number.
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 100011011000011 - 27 = 100011010999883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100011010999958 and 100011011000003.
It is not an unprimeable number, because it can be changed into a prime (100011011009011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8550250 + ... + 16526608.
It is an arithmetic number, because the mean of its divisors is an integer number (12555265233420).
Almost surely, 2100011011000011 is an apocalyptic number.
100011011000011 is a deficient number, since it is larger than the sum of its proper divisors (431110867349).
100011011000011 is an equidigital number, since it uses as much as digits as its factorization.
100011011000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8030405.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100011011000011 its reverse (110000110110001), we get a palindrome (210011121110012).
The spelling of 100011011000011 in words is "one hundred trillion, eleven billion, eleven million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •