Base | Representation |
---|---|
bin | 11001000010001011101001… |
… | …100011010011000010010001 |
3 | 112102211120012122212110211022 |
4 | 121002023221203103002101 |
5 | 103412344033130310001 |
6 | 1030055430210125225 |
7 | 32122354100442035 |
oct | 3102135143230221 |
9 | 472746178773738 |
10 | 110101110010001 |
11 | 320996892a8230 |
12 | 104223bab80815 |
13 | 495864aa57b46 |
14 | 1d28cca5881c5 |
15 | cadeb110e11b |
hex | 6422e98d3091 |
110101110010001 has 16 divisors (see below), whose sum is σ = 121904566660800. Its totient is φ = 98596736071680.
The previous prime is 110101110009991. The next prime is 110101110010009. The reversal of 110101110010001 is 100010011101011.
It is not a de Polignac number, because 110101110010001 - 214 = 110101109993617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110101110010009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58661825 + ... + 60509601.
It is an arithmetic number, because the mean of its divisors is an integer number (7619035416300).
Almost surely, 2110101110010001 is an apocalyptic number.
110101110010001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110101110010001 is a deficient number, since it is larger than the sum of its proper divisors (11803456650799).
110101110010001 is a wasteful number, since it uses less digits than its factorization.
110101110010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1928704.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110101110010001 its reverse (100010011101011), we get a palindrome (210111121111012).
The spelling of 110101110010001 in words is "one hundred ten trillion, one hundred one billion, one hundred ten million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •