Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …101001001110100010110011 |
3 | 111010110102102210102102012122 |
4 | 112300302231221032202303 |
5 | 101110200300304013021 |
6 | 552525523144144455 |
7 | 30041465253211514 |
oct | 2660625551164263 |
9 | 433412383372178 |
10 | 100110011001011 |
11 | 29997465390530 |
12 | b289ba816812b |
13 | 43b24449c520b |
14 | 1aa14c965aa0b |
15 | b8915783bbab |
hex | 5b0cada4e8b3 |
100110011001011 has 32 divisors (see below), whose sum is σ = 118285246550016. Its totient is φ = 83778610608000.
The previous prime is 100110011000983. The next prime is 100110011001017. The reversal of 100110011001011 is 110100110011001.
It is a de Polignac number, because none of the positive numbers 2k-100110011001011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100110011001011.
It is not an unprimeable number, because it can be changed into a prime (100110011001017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33840776 + ... + 36679941.
It is an arithmetic number, because the mean of its divisors is an integer number (3696413954688).
Almost surely, 2100110011001011 is an apocalyptic number.
100110011001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100110011001011 is a deficient number, since it is larger than the sum of its proper divisors (18175235549005).
100110011001011 is a wasteful number, since it uses less digits than its factorization.
100110011001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70520963.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100110011001011 its reverse (110100110011001), we get a palindrome (210210121012012).
The spelling of 100110011001011 in words is "one hundred trillion, one hundred ten billion, eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •