Base | Representation |
---|---|
bin | 10011011000110011111… |
… | …100011001010101110101 |
3 | 11201100221001211012100001 |
4 | 103120303330121111311 |
5 | 133312033200112323 |
6 | 2500015543351301 |
7 | 165153626320201 |
oct | 23306374312565 |
9 | 4640831735301 |
10 | 1332311332213 |
11 | 474037017334 |
12 | 196264452531 |
13 | 988372a1724 |
14 | 486ac971b01 |
15 | 249ca90d3ad |
hex | 13633f19575 |
1332311332213 has 2 divisors, whose sum is σ = 1332311332214. Its totient is φ = 1332311332212.
The previous prime is 1332311332199. The next prime is 1332311332243. The reversal of 1332311332213 is 3122331132331.
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., 1038978605809 + 293332726404 = 1019303^2 + 541602^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332311332213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1332311332243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666155666106 + 666155666107.
It is an arithmetic number, because the mean of its divisors is an integer number (666155666107).
Almost surely, 21332311332213 is an apocalyptic number.
It is an amenable number.
1332311332213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332311332213 is an equidigital number, since it uses as much as digits as its factorization.
1332311332213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5832, while the sum is 28.
Adding to 1332311332213 its reverse (3122331132331), we get a palindrome (4454642464544).
The spelling of 1332311332213 in words is "one trillion, three hundred thirty-two billion, three hundred eleven million, three hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •