Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …0001111100010010110001 |
3 | 1022210121111221200121102022 |
4 | 2103020230201330102301 |
5 | 2311130013112010001 |
6 | 33300550354001225 |
7 | 2062334325606452 |
oct | 223105441742261 |
9 | 38717457617368 |
10 | 10111100110001 |
11 | 3249103464050 |
12 | 1173722b76215 |
13 | 58461b544197 |
14 | 26d54647d129 |
15 | 12802d8e411b |
hex | 9322c87c4b1 |
10111100110001 has 16 divisors (see below), whose sum is σ = 11091780182016. Its totient is φ = 9140700690000.
The previous prime is 10111100109991. The next prime is 10111100110021. The reversal of 10111100110001 is 10001100111101.
It is not a de Polignac number, because 10111100110001 - 26 = 10111100109937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111100110021) 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, 5432156 + ... + 7051986.
It is an arithmetic number, because the mean of its divisors is an integer number (693236261376).
Almost surely, 210111100110001 is an apocalyptic number.
10111100110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10111100110001 is a deficient number, since it is larger than the sum of its proper divisors (980680072015).
10111100110001 is a wasteful number, since it uses less digits than its factorization.
10111100110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1623004.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10111100110001 its reverse (10001100111101), we get a palindrome (20112200221102).
The spelling of 10111100110001 in words is "ten trillion, one hundred eleven billion, one hundred million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •