Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …101011110010101100010011 |
3 | 111010002000002022222222101021 |
4 | 112233031030223302230103 |
5 | 101101404032041213021 |
6 | 552403455124420311 |
7 | 30030556152643165 |
oct | 2657151453625423 |
9 | 433060068888337 |
10 | 100001010101011 |
11 | 299552101a9aa8 |
12 | b270a47b47697 |
13 | 43a50934ab956 |
14 | 1a9a10902c935 |
15 | b863c82e8c41 |
hex | 5af34caf2b13 |
100001010101011 has 8 divisors (see below), whose sum is σ = 105883657775280. Its totient is φ = 94118388572928.
The previous prime is 100001010101009. The next prime is 100001010101029. The reversal of 100001010101011 is 110101010100001.
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 100001010101011 - 21 = 100001010101009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100001010100985 and 100001010101003.
It is not an unprimeable number, because it can be changed into a prime (100001010801011) 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, 1629295 + ... + 14235751.
It is an arithmetic number, because the mean of its divisors is an integer number (13235457221910).
Almost surely, 2100001010101011 is an apocalyptic number.
100001010101011 is a deficient number, since it is larger than the sum of its proper divisors (5882647674269).
100001010101011 is a wasteful number, since it uses less digits than its factorization.
100001010101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13073093.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100001010101011 its reverse (110101010100001), we get a palindrome (210102020201012).
The spelling of 100001010101011 in words is "one hundred trillion, one billion, ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •