Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …000101101101001011110011 |
3 | 111010002222010111221000010021 |
4 | 112233112212011231023303 |
5 | 101102040213100013021 |
6 | 552412244242144311 |
7 | 30031364201453233 |
oct | 2657264605551363 |
9 | 433088114830107 |
10 | 100011100001011 |
11 | 29959518737231 |
12 | b2729a3052097 |
13 | 43a60109b4694 |
14 | 1a9a7c50b3cc3 |
15 | b867b9013c41 |
hex | 5af5a616d2f3 |
100011100001011 has 8 divisors (see below), whose sum is σ = 101381564099520. Its totient is φ = 98640648038592.
The previous prime is 100011100001009. The next prime is 100011100001039. The reversal of 100011100001011 is 110100001110001.
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 100011100001011 - 21 = 100011100001009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100011100000985 and 100011100001003.
It is not an unprimeable number, because it can be changed into a prime (100011100001081) 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, 14228886 + ... + 20061988.
It is an arithmetic number, because the mean of its divisors is an integer number (12672695512440).
Almost surely, 2100011100001011 is an apocalyptic number.
100011100001011 is a deficient number, since it is larger than the sum of its proper divisors (1370464098509).
100011100001011 is an equidigital number, since it uses as much as digits as its factorization.
100011100001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6068045.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100011100001011 its reverse (110100001110001), we get a palindrome (210111101111012).
The spelling of 100011100001011 in words is "one hundred trillion, eleven billion, one hundred million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •