Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …0011111000000011100101 |
3 | 1102222202012122110101111022 |
4 | 2200033311203320003211 |
5 | 2420410310434032323 |
6 | 35230522030420525 |
7 | 2214412424044232 |
oct | 240176543700345 |
9 | 42882178411438 |
10 | 11012121002213 |
11 | 356623a247311 |
12 | 129a281061745 |
13 | 61b591673a06 |
14 | 2a0dbd290789 |
15 | 1416b587c4c8 |
hex | a03f58f80e5 |
11012121002213 has 2 divisors, whose sum is σ = 11012121002214. Its totient is φ = 11012121002212.
The previous prime is 11012121002167. The next prime is 11012121002263. The reversal of 11012121002213 is 31220012121011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10563325516129 + 448795486084 = 3250127^2 + 669922^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012121002213 - 28 = 11012121001957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11012121002191 and 11012121002200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012121002263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506060501106 + 5506060501107.
It is an arithmetic number, because the mean of its divisors is an integer number (5506060501107).
Almost surely, 211012121002213 is an apocalyptic number.
It is an amenable number.
11012121002213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012121002213 is an equidigital number, since it uses as much as digits as its factorization.
11012121002213 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 11012121002213 its reverse (31220012121011), we get a palindrome (42232133123224).
The spelling of 11012121002213 in words is "eleven trillion, twelve billion, one hundred twenty-one million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •