Base | Representation |
---|---|
bin | 1010000000011011110111… |
… | …1100010110011011000001 |
3 | 1102221211121222011200120111 |
4 | 2200012331330112123001 |
5 | 2420231310034144421 |
6 | 35222305042511321 |
7 | 2213624430365011 |
oct | 240067574263301 |
9 | 42854558150514 |
10 | 11002597959361 |
11 | 35621a2790268 |
12 | 1298463965541 |
13 | 61a704731208 |
14 | 2a0758605c41 |
15 | 1413097d4ee1 |
hex | a01bdf166c1 |
11002597959361 has 2 divisors, whose sum is σ = 11002597959362. Its totient is φ = 11002597959360.
The previous prime is 11002597959313. The next prime is 11002597959371. The reversal of 11002597959361 is 16395979520011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9390792513600 + 1611805445761 = 3064440^2 + 1269569^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002597959361 - 237 = 10865159005889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11002597959296 and 11002597959305.
It is not a weakly prime, because it can be changed into another prime (11002597959371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501298979680 + 5501298979681.
It is an arithmetic number, because the mean of its divisors is an integer number (5501298979681).
Almost surely, 211002597959361 is an apocalyptic number.
It is an amenable number.
11002597959361 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002597959361 is an equidigital number, since it uses as much as digits as its factorization.
11002597959361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4592700, while the sum is 58.
The spelling of 11002597959361 in words is "eleven trillion, two billion, five hundred ninety-seven million, nine hundred fifty-nine thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •