Base | Representation |
---|---|
bin | 10011011000101101111… |
… | …011000110110110010011 |
3 | 11201100200000202210202101 |
4 | 103120231323012312103 |
5 | 133311331321043102 |
6 | 2500001534501231 |
7 | 165151261655122 |
oct | 23305573066623 |
9 | 4640600683671 |
10 | 1332210331027 |
11 | 473a95001684 |
12 | 196236664817 |
13 | 9881c39a304 |
14 | 4869d39dab9 |
15 | 249c1b0be87 |
hex | 1362dec6d93 |
1332210331027 has 2 divisors, whose sum is σ = 1332210331028. Its totient is φ = 1332210331026.
The previous prime is 1332210331007. The next prime is 1332210331043. The reversal of 1332210331027 is 7201330122331.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (7201330122331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332210331027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1332210330986 and 1332210331004.
It is not a weakly prime, because it can be changed into another prime (1332210331007) 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, 666105165513 + 666105165514.
It is an arithmetic number, because the mean of its divisors is an integer number (666105165514).
Almost surely, 21332210331027 is an apocalyptic number.
1332210331027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332210331027 is an equidigital number, since it uses as much as digits as its factorization.
1332210331027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 1332210331027 its reverse (7201330122331), we get a palindrome (8533540453358).
The spelling of 1332210331027 in words is "one trillion, three hundred thirty-two billion, two hundred ten million, three hundred thirty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •