Base | Representation |
---|---|
bin | 10011001101101001010… |
… | …110010101000110000011 |
3 | 11200012222112120102002222 |
4 | 103031221112111012003 |
5 | 133113010014433443 |
6 | 2450314151401255 |
7 | 164250551256506 |
oct | 23155126250603 |
9 | 4605875512088 |
10 | 1320322421123 |
11 | 469a44649a52 |
12 | 193a7938322b |
13 | 976765202b4 |
14 | 47c925dd13d |
15 | 2452812d468 |
hex | 13369595183 |
1320322421123 has 2 divisors, whose sum is σ = 1320322421124. Its totient is φ = 1320322421122.
The previous prime is 1320322421101. The next prime is 1320322421207. The reversal of 1320322421123 is 3211242230231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1320322421123 - 218 = 1320322158979 is a prime.
It is a super-2 number, since 2×13203224211232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1320322421092 and 1320322421101.
It is not a weakly prime, because it can be changed into another prime (1320322421323) 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, 660161210561 + 660161210562.
It is an arithmetic number, because the mean of its divisors is an integer number (660161210562).
Almost surely, 21320322421123 is an apocalyptic number.
1320322421123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320322421123 is an equidigital number, since it uses as much as digits as its factorization.
1320322421123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1320322421123 its reverse (3211242230231), we get a palindrome (4531564651354).
The spelling of 1320322421123 in words is "one trillion, three hundred twenty billion, three hundred twenty-two million, four hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •