Base | Representation |
---|---|
bin | 100100100000011010011010… |
… | …1101010111011000110111011 |
3 | 1120002222012200212012000000202 |
4 | 1021000310311222323012323 |
5 | 314042113214331030133 |
6 | 3054541443413552415 |
7 | 124431505333202021 |
oct | 11100646552730673 |
9 | 1502865625160022 |
10 | 321114130330043 |
11 | 93353813163666 |
12 | 300220a064570b |
13 | 10a23c17aa574b |
14 | 5942014a7c711 |
15 | 271cdae9702e8 |
hex | 1240d35abb1bb |
321114130330043 has 2 divisors, whose sum is σ = 321114130330044. Its totient is φ = 321114130330042.
The previous prime is 321114130330003. The next prime is 321114130330061. The reversal of 321114130330043 is 340033031411123.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 321114130330043 - 214 = 321114130313659 is a prime.
It is a super-2 number, since 2×3211141303300432 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 321114130329988 and 321114130330015.
It is not a weakly prime, because it can be changed into another prime (321114130330003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160557065165021 + 160557065165022.
It is an arithmetic number, because the mean of its divisors is an integer number (160557065165022).
Almost surely, 2321114130330043 is an apocalyptic number.
321114130330043 is a deficient number, since it is larger than the sum of its proper divisors (1).
321114130330043 is an equidigital number, since it uses as much as digits as its factorization.
321114130330043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 321114130330043 its reverse (340033031411123), we get a palindrome (661147161741166).
The spelling of 321114130330043 in words is "three hundred twenty-one trillion, one hundred fourteen billion, one hundred thirty million, three hundred thirty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •