Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …000010001011101101110011 |
3 | 111010001220202121022011022020 |
4 | 112233030113002023231303 |
5 | 101101400211130013021 |
6 | 552403225532242523 |
7 | 30030524643140013 |
oct | 2657142702135563 |
9 | 433056677264266 |
10 | 100000110001011 |
11 | 29954899109600 |
12 | b270836610443 |
13 | 43a4c7bb7b8bc |
14 | 1a9a061687c43 |
15 | b8637429c7c6 |
hex | 5af31708bb73 |
100000110001011 has 48 divisors (see below), whose sum is σ = 150535792307712. Its totient is φ = 58961006533440.
The previous prime is 100000110000979. The next prime is 100000110001139. The reversal of 100000110001011 is 110100011000001.
It is not a de Polignac number, because 100000110001011 - 25 = 100000110000979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100000110006011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 111878310 + ... + 112768596.
It is an arithmetic number, because the mean of its divisors is an integer number (3136162339744).
Almost surely, 2100000110001011 is an apocalyptic number.
100000110001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100000110001011 is a deficient number, since it is larger than the sum of its proper divisors (50535682306701).
100000110001011 is a wasteful number, since it uses less digits than its factorization.
100000110001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 898712 (or 898701 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100000110001011 its reverse (110100011000001), we get a palindrome (210100121001012).
It can be divided in two parts, 100000 and 110001011, that added together give a palindrome (110101011).
The spelling of 100000110001011 in words is "one hundred trillion, one hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •