Base | Representation |
---|---|
bin | 1010010010011100100110… |
… | …1010010110000100001101 |
3 | 1111001102022222022100212212 |
4 | 2210213021222112010031 |
5 | 2440314020221224323 |
6 | 40020401552440205 |
7 | 2245160463210656 |
oct | 244471152260415 |
9 | 44042288270785 |
10 | 11312032211213 |
11 | 3671451308618 |
12 | 1328420849065 |
13 | 640948c84a66 |
14 | 2b17106bc52d |
15 | 1493ba34cb78 |
hex | a49c9a9610d |
11312032211213 has 2 divisors, whose sum is σ = 11312032211214. Its totient is φ = 11312032211212.
The previous prime is 11312032211197. The next prime is 11312032211261. The reversal of 11312032211213 is 31211223021311.
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., 7315499459524 + 3996532751689 = 2704718^2 + 1999133^2 .
It is a cyclic number.
It is not a de Polignac number, because 11312032211213 - 24 = 11312032211197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11312032211413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656016105606 + 5656016105607.
It is an arithmetic number, because the mean of its divisors is an integer number (5656016105607).
Almost surely, 211312032211213 is an apocalyptic number.
It is an amenable number.
11312032211213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11312032211213 is an equidigital number, since it uses as much as digits as its factorization.
11312032211213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11312032211213 its reverse (31211223021311), we get a palindrome (42523255232524).
The spelling of 11312032211213 in words is "eleven trillion, three hundred twelve billion, thirty-two million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •