Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1001010001111010001001 |
3 | 1102222112201211121102222120 |
4 | 2200031313021101322021 |
5 | 2420341440011213001 |
6 | 35225531344241453 |
7 | 2214306031505616 |
oct | 240156711217211 |
9 | 42875654542876 |
10 | 11010000101001 |
11 | 35653510328a0 |
12 | 129998a910289 |
13 | 61b314148495 |
14 | 2a0c5b72350d |
15 | 1415de587236 |
hex | a0377251e89 |
11010000101001 has 8 divisors (see below), whose sum is σ = 16014545601504. Its totient is φ = 6672727333920.
The previous prime is 11010000100993. The next prime is 11010000101027. The reversal of 11010000101001 is 10010100001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11010000101001 - 23 = 11010000100993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11010000101081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166818183316 + ... + 166818183381.
It is an arithmetic number, because the mean of its divisors is an integer number (2001818200188).
Almost surely, 211010000101001 is an apocalyptic number.
11010000101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11010000101001 is a deficient number, since it is larger than the sum of its proper divisors (5004545500503).
11010000101001 is a wasteful number, since it uses less digits than its factorization.
11010000101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333636366711.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11010000101001 its reverse (10010100001011), we get a palindrome (21020100102012).
It can be divided in two parts, 1101000010 and 1001, that added together give a palindrome (1101001011).
The spelling of 11010000101001 in words is "eleven trillion, ten billion, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •