Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …000101100100110100100011 |
3 | 111010002212120112021101022200 |
4 | 112233111223011210310203 |
5 | 101102031201142023021 |
6 | 552412002121304243 |
7 | 30031330521520452 |
oct | 2657255305446443 |
9 | 433085515241280 |
10 | 100010110111011 |
11 | 2995905a999221 |
12 | b272767635083 |
13 | 43a5bb38a7159 |
14 | 1a9a72d838b99 |
15 | b8675c17d126 |
hex | 5af56b164d23 |
100010110111011 has 12 divisors (see below), whose sum is σ = 147532644703392. Its totient is φ = 65254823618256.
The previous prime is 100010110111001. The next prime is 100010110111091. The reversal of 100010110111011 is 110111011010001.
It is not a de Polignac number, because 100010110111011 - 214 = 100010110094627 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 = 100010110110984 and 100010110111002.
It is not an unprimeable number, because it can be changed into a prime (100010110111001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 118215259756 + ... + 118215260601.
It is an arithmetic number, because the mean of its divisors is an integer number (12294387058616).
Almost surely, 2100010110111011 is an apocalyptic number.
100010110111011 is a deficient number, since it is larger than the sum of its proper divisors (47522534592381).
100010110111011 is a wasteful number, since it uses less digits than its factorization.
100010110111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236430520410 (or 236430520407 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100010110111011 its reverse (110111011010001), we get a palindrome (210121121121012).
The spelling of 100010110111011 in words is "one hundred trillion, ten billion, one hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •