Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0011110101011000010001 |
3 | 1022110001101202212011222220 |
4 | 2101223210003311120101 |
5 | 2303010213100310001 |
6 | 33143011424451253 |
7 | 2052164251023426 |
oct | 221534403653021 |
9 | 38401352764886 |
10 | 10011100010001 |
11 | 320a757a6a902 |
12 | 1158275179b29 |
13 | 5780729cb08c |
14 | 26877b3d3d4d |
15 | 125629689c36 |
hex | 91ae40f5611 |
10011100010001 has 8 divisors (see below), whose sum is σ = 13348151978304. Its totient is φ = 6674057357520.
The previous prime is 10011100009931. The next prime is 10011100010003. The reversal of 10011100010001 is 10001000111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10011100010001 - 237 = 9873661056529 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10011100010003) 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 7 ways as a sum of consecutive naturals, for example, 766135 + ... + 4539731.
It is an arithmetic number, because the mean of its divisors is an integer number (1668518997288).
Almost surely, 210011100010001 is an apocalyptic number.
It is an amenable number.
10011100010001 is a deficient number, since it is larger than the sum of its proper divisors (3337051968303).
10011100010001 is an equidigital number, since it uses as much as digits as its factorization.
10011100010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4657911.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10011100010001 its reverse (10001000111001), we get a palindrome (20012100121002).
It can be divided in two parts, 100111000 and 10001, that added together give a palindrome (100121001).
The spelling of 10011100010001 in words is "ten trillion, eleven billion, one hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •