Base | Representation |
---|---|
bin | 10011001101101111010… |
… | …000011010111110000111 |
3 | 11200020020110001221122101 |
4 | 103031233100122332013 |
5 | 133113210403114443 |
6 | 2450332052012531 |
7 | 164253163603201 |
oct | 23155720327607 |
9 | 4606213057571 |
10 | 1320421535623 |
11 | 469a95596163 |
12 | 193aa6601147 |
13 | 97690c13a28 |
14 | 47ca183d771 |
15 | 24531baa84d |
hex | 1336f41af87 |
1320421535623 has 2 divisors, whose sum is σ = 1320421535624. Its totient is φ = 1320421535622.
The previous prime is 1320421535621. The next prime is 1320421535627. The reversal of 1320421535623 is 3265351240231.
It is a weak prime.
It is an emirp because it is prime and its reverse (3265351240231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1320421535623 - 21 = 1320421535621 is a prime.
Together with 1320421535621, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320421535621) 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, 660210767811 + 660210767812.
It is an arithmetic number, because the mean of its divisors is an integer number (660210767812).
Almost surely, 21320421535623 is an apocalyptic number.
1320421535623 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320421535623 is an equidigital number, since it uses as much as digits as its factorization.
1320421535623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 1320421535623 its reverse (3265351240231), we get a palindrome (4585772775854).
The spelling of 1320421535623 in words is "one trillion, three hundred twenty billion, four hundred twenty-one million, five hundred thirty-five thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •