Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …010110010101101001101011 |
3 | 111020121121112002110200110000 |
4 | 112331300213112111221223 |
5 | 101214300233420200021 |
6 | 554451134143554043 |
7 | 30163042455115023 |
oct | 2675604726255153 |
9 | 436547462420400 |
10 | 101001111100011 |
11 | 2a200370138a41 |
12 | b3b28378bb923 |
13 | 444849667a8c5 |
14 | 1ad26a0a46a83 |
15 | ba240d860b26 |
hex | 5bdc27595a6b |
101001111100011 has 40 divisors (see below), whose sum is σ = 151329901662720. Its totient is φ = 67132780330608.
The previous prime is 101001111099961. The next prime is 101001111100031. The reversal of 101001111100011 is 110001111100101.
It is not a de Polignac number, because 101001111100011 - 27 = 101001111099883 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 = 101001111099966 and 101001111100002.
It is not an unprimeable number, because it can be changed into a prime (101001111100031) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 36185710 + ... + 38876828.
It is an arithmetic number, because the mean of its divisors is an integer number (3783247541568).
Almost surely, 2101001111100011 is an apocalyptic number.
101001111100011 is a deficient number, since it is larger than the sum of its proper divisors (50328790562709).
101001111100011 is an equidigital number, since it uses as much as digits as its factorization.
101001111100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2692517 (or 2692508 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101001111100011 its reverse (110001111100101), we get a palindrome (211002222200112).
The spelling of 101001111100011 in words is "one hundred one trillion, one billion, one hundred eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •