Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0111000010011001110001 |
3 | 1022101222202222010200212220 |
4 | 2101201033013002121301 |
5 | 2302320010321010001 |
6 | 33133535223111253 |
7 | 2051322411646053 |
oct | 221411707023161 |
9 | 38358688120786 |
10 | 10000011110001 |
11 | 3205a87632140 |
12 | 115609b5a2529 |
13 | 576cc65483a3 |
14 | 2680087c18d3 |
15 | 1251cadd9c36 |
hex | 9184f1c2671 |
10000011110001 has 32 divisors (see below), whose sum is σ = 14892202659840. Its totient is φ = 5916301473600.
The previous prime is 10000011109909. The next prime is 10000011110027. The reversal of 10000011110001 is 10001111000001.
It is not a de Polignac number, because 10000011110001 - 27 = 10000011109873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10000011110051) 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 31 ways as a sum of consecutive naturals, for example, 492831 + ... + 4499211.
It is an arithmetic number, because the mean of its divisors is an integer number (465381333120).
Almost surely, 210000011110001 is an apocalyptic number.
10000011110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10000011110001 is a deficient number, since it is larger than the sum of its proper divisors (4892191549839).
10000011110001 is a wasteful number, since it uses less digits than its factorization.
10000011110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4008197.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10000011110001 its reverse (10001111000001), we get a palindrome (20001122110002).
The spelling of 10000011110001 in words is "ten trillion, eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •