Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101101000100111001010011 |
3 | 111010002000100101001022100000 |
4 | 112233031102231010321103 |
5 | 101101404233420213021 |
6 | 552403513133301043 |
7 | 30030561520301631 |
oct | 2657152255047123 |
9 | 433060311038300 |
10 | 100001111101011 |
11 | 2995526221387a |
12 | b270a75934783 |
13 | 43a50ab3b2673 |
14 | 1a9a118600351 |
15 | b863d20e9b26 |
hex | 5af352b44e53 |
100001111101011 has 96 divisors (see below), whose sum is σ = 156778394572800. Its totient is φ = 63623459370240.
The previous prime is 100001111101007. The next prime is 100001111101043. The reversal of 100001111101011 is 110101111100001.
It is not a de Polignac number, because 100001111101011 - 22 = 100001111101007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100001111100984 and 100001111101002.
It is not an unprimeable number, because it can be changed into a prime (100001111101061) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 253898845 + ... + 254292401.
It is an arithmetic number, because the mean of its divisors is an integer number (1633108276800).
Almost surely, 2100001111101011 is an apocalyptic number.
100001111101011 is a deficient number, since it is larger than the sum of its proper divisors (56777283471789).
100001111101011 is an equidigital number, since it uses as much as digits as its factorization.
100001111101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394071 (or 394059 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100001111101011 its reverse (110101111100001), we get a palindrome (210102222201012).
The spelling of 100001111101011 in words is "one hundred trillion, one billion, one hundred eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •