Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …1011000110101101110001 |
3 | 1102221121012000121221012001 |
4 | 2200010221023012231301 |
5 | 2420211202104201001 |
6 | 35221213242134001 |
7 | 2213505532306501 |
oct | 240045113065561 |
9 | 42847160557161 |
10 | 11000102022001 |
11 | 3561131901614 |
12 | 1297a87ab1301 |
13 | 61a3c75c4cc1 |
14 | 2a059cd31a01 |
15 | 14121060d001 |
hex | a01292c6b71 |
11000102022001 has 8 divisors (see below), whose sum is σ = 11044892615400. Its totient is φ = 10955326844928.
The previous prime is 11000102021941. The next prime is 11000102022011. The reversal of 11000102022001 is 10022020100011.
It can be written as a sum of positive squares in 4 ways, for example, as 4796012400400 + 6204089621601 = 2189980^2 + 2490801^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11000102022001 - 223 = 11000093633393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000102022011) 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, 2423026 + ... + 5279323.
It is an arithmetic number, because the mean of its divisors is an integer number (1380611576925).
Almost surely, 211000102022001 is an apocalyptic number.
It is an amenable number.
11000102022001 is a deficient number, since it is larger than the sum of its proper divisors (44790593399).
11000102022001 is an equidigital number, since it uses as much as digits as its factorization.
11000102022001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7708163.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11000102022001 its reverse (10022020100011), we get a palindrome (21022122122012).
The spelling of 11000102022001 in words is "eleven trillion, one hundred two million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •