Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1010100001011011100001 |
3 | 1022110001010212202000222120 |
4 | 2101223132022201123201 |
5 | 2303010012240200001 |
6 | 33142553532454453 |
7 | 2052161640221166 |
oct | 221533612413341 |
9 | 38401125660876 |
10 | 10011001100001 |
11 | 320a707153300 |
12 | 115824801a429 |
13 | 578058379755 |
14 | 26876c20806d |
15 | 125620b4d236 |
hex | 91ade2a16e1 |
10011001100001 has 48 divisors (see below), whose sum is σ = 14808240216000. Its totient is φ = 6010852510080.
The previous prime is 10011001099951. The next prime is 10011001100059. The reversal of 10011001100001 is 10000110011001.
It is not a de Polignac number, because 10011001100001 - 218 = 10011000837857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10011001100201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 585464350 + ... + 585481448.
It is an arithmetic number, because the mean of its divisors is an integer number (308505004500).
Almost surely, 210011001100001 is an apocalyptic number.
10011001100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10011001100001 is a deficient number, since it is larger than the sum of its proper divisors (4797239115999).
10011001100001 is a wasteful number, since it uses less digits than its factorization.
10011001100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32030 (or 32019 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10011001100001 its reverse (10000110011001), we get a palindrome (20011111111002).
It can be divided in two parts, 10011001 and 100001, that multiplied together give a palindrome (1001110111001).
The spelling of 10011001100001 in words is "ten trillion, eleven billion, one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •