Base | Representation |
---|---|
bin | 10110101111001100010110… |
… | …011111111000111001000011 |
3 | 111010001220201222101102100021 |
4 | 112233030112133320321003 |
5 | 101101400201324323021 |
6 | 552403225011434311 |
7 | 30030524503545055 |
oct | 2657142637707103 |
9 | 433056658342307 |
10 | 100000101011011 |
11 | 29954894029253 |
12 | b2708335b5997 |
13 | 43a4c7a051986 |
14 | 1a9a0603c78d5 |
15 | b863735c3c41 |
hex | 5af3167f8e43 |
100000101011011 has 8 divisors (see below), whose sum is σ = 100018887549984. Its totient is φ = 99981315420480.
The previous prime is 100000101011009. The next prime is 100000101011081. The reversal of 100000101011011 is 110110101000001.
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 100000101011011 - 21 = 100000101011009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000101010985 and 100000101011003.
It is not an unprimeable number, because it can be changed into a prime (100000101011081) 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, 231700426 + ... + 232131616.
It is an arithmetic number, because the mean of its divisors is an integer number (12502360943748).
Almost surely, 2100000101011011 is an apocalyptic number.
100000101011011 is a deficient number, since it is larger than the sum of its proper divisors (18786538973).
100000101011011 is an equidigital number, since it uses as much as digits as its factorization.
100000101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474221.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100000101011011 its reverse (110110101000001), we get a palindrome (210110202011012).
The spelling of 100000101011011 in words is "one hundred trillion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •