Base | Representation |
---|---|
bin | 10011001101100011010… |
… | …101000010101000001111 |
3 | 11200012201111112000200101 |
4 | 103031203111002220033 |
5 | 133112303140420142 |
6 | 2450300142511531 |
7 | 164245213624645 |
oct | 23154325025017 |
9 | 4605644460611 |
10 | 1320221420047 |
11 | 4699a2634392 |
12 | 193a4b5955a7 |
13 | 9765b618c4a |
14 | 47c8302b195 |
15 | 2451e32c0b7 |
hex | 13363542a0f |
1320221420047 has 2 divisors, whose sum is σ = 1320221420048. Its totient is φ = 1320221420046.
The previous prime is 1320221419987. The next prime is 1320221420059. The reversal of 1320221420047 is 7400241220231.
It is a strong prime.
It is an emirp because it is prime and its reverse (7400241220231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1320221420047 - 27 = 1320221419919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1320221419997 and 1320221420024.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320221420447) 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, 660110710023 + 660110710024.
It is an arithmetic number, because the mean of its divisors is an integer number (660110710024).
Almost surely, 21320221420047 is an apocalyptic number.
1320221420047 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320221420047 is an equidigital number, since it uses as much as digits as its factorization.
1320221420047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 28.
Adding to 1320221420047 its reverse (7400241220231), we get a palindrome (8720462640278).
The spelling of 1320221420047 in words is "one trillion, three hundred twenty billion, two hundred twenty-one million, four hundred twenty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •