Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …0100000111100010110001 |
3 | 1102221210002022101212201212 |
4 | 2200012122110013202301 |
5 | 2420224044023210342 |
6 | 35222125451005505 |
7 | 2213603551531541 |
oct | 240063224074261 |
9 | 42853068355655 |
10 | 11002000210097 |
11 | 3561a1632a406 |
12 | 1298317739895 |
13 | 61a63a942c20 |
14 | 2a06dd087321 |
15 | 1412c20ae182 |
hex | a019a5078b1 |
11002000210097 has 4 divisors (see below), whose sum is σ = 11848307918580. Its totient is φ = 10155692501616.
The previous prime is 11002000210051. The next prime is 11002000210111. The reversal of 11002000210097 is 79001200020011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6710374212721 + 4291625997376 = 2590439^2 + 2071624^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002000210097 - 214 = 11002000193713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11002000210297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 423153854222 + ... + 423153854247.
It is an arithmetic number, because the mean of its divisors is an integer number (2962076979645).
Almost surely, 211002000210097 is an apocalyptic number.
It is an amenable number.
11002000210097 is a deficient number, since it is larger than the sum of its proper divisors (846307708483).
11002000210097 is an equidigital number, since it uses as much as digits as its factorization.
11002000210097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 846307708482.
The product of its (nonzero) digits is 252, while the sum is 23.
The spelling of 11002000210097 in words is "eleven trillion, two billion, two hundred ten thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •