Base | Representation |
---|---|
bin | 1010000000111111101110… |
… | …0001011000110011010001 |
3 | 1102222202110121122110202222 |
4 | 2200033323201120303101 |
5 | 2420411012034410301 |
6 | 35230540002150425 |
7 | 2214415050113402 |
oct | 240177341306321 |
9 | 42882417573688 |
10 | 11012221013201 |
11 | 3566290746021 |
12 | 129a2aa652415 |
13 | 61b5a92bc505 |
14 | 2a0dcc6859a9 |
15 | 1416be53531b |
hex | a03fb858cd1 |
11012221013201 has 2 divisors, whose sum is σ = 11012221013202. Its totient is φ = 11012221013200.
The previous prime is 11012221013077. The next prime is 11012221013207. The reversal of 11012221013201 is 10231012221011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9323715682576 + 1688505330625 = 3053476^2 + 1299425^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012221013201 - 226 = 11012153904337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11012221013201.
It is not a weakly prime, because it can be changed into another prime (11012221013207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506110506600 + 5506110506601.
It is an arithmetic number, because the mean of its divisors is an integer number (5506110506601).
Almost surely, 211012221013201 is an apocalyptic number.
It is an amenable number.
11012221013201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012221013201 is an equidigital number, since it uses as much as digits as its factorization.
11012221013201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11012221013201 its reverse (10231012221011), we get a palindrome (21243233234212).
The spelling of 11012221013201 in words is "eleven trillion, twelve billion, two hundred twenty-one million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •