Base | Representation |
---|---|
bin | 100100110001010010110010… |
… | …1010000011001000011011101 |
3 | 1120102012000020021022200012102 |
4 | 1021202211211100121003131 |
5 | 314343121231010133041 |
6 | 3103515343023014445 |
7 | 125061231155531132 |
oct | 11142454520310335 |
9 | 1512160207280172 |
10 | 323434211021021 |
11 | 94068751233021 |
12 | 30337872a3a425 |
13 | 10b6193b486089 |
14 | 59c242955c589 |
15 | 275d3eceb609b |
hex | 12629654190dd |
323434211021021 has 2 divisors, whose sum is σ = 323434211021022. Its totient is φ = 323434211021020.
The previous prime is 323434211021011. The next prime is 323434211021029. The reversal of 323434211021021 is 120120112434323.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 288588270748996 + 34845940272025 = 16987886^2 + 5903045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323434211021021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323434211021029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161717105510510 + 161717105510511.
It is an arithmetic number, because the mean of its divisors is an integer number (161717105510511).
Almost surely, 2323434211021021 is an apocalyptic number.
It is an amenable number.
323434211021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
323434211021021 is an equidigital number, since it uses as much as digits as its factorization.
323434211021021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 323434211021021 its reverse (120120112434323), we get a palindrome (443554323455344).
The spelling of 323434211021021 in words is "three hundred twenty-three trillion, four hundred thirty-four billion, two hundred eleven million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •