Base | Representation |
---|---|
bin | 100100101110010110101010… |
… | …1101001000010110010011101 |
3 | 1120100202101110120221020122001 |
4 | 1021130231111221002302131 |
5 | 314320011343330402031 |
6 | 3103010011350522301 |
7 | 125020110016540252 |
oct | 11134552551026235 |
9 | 1510671416836561 |
10 | 323030222122141 |
11 | 93a22391009986 |
12 | 30291507966391 |
13 | 10b32808612151 |
14 | 59aaa636d5429 |
15 | 2752b562db861 |
hex | 125cb55a42c9d |
323030222122141 has 2 divisors, whose sum is σ = 323030222122142. Its totient is φ = 323030222122140.
The previous prime is 323030222122123. The next prime is 323030222122193. The reversal of 323030222122141 is 141221222030323.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 304803726559641 + 18226495562500 = 17458629^2 + 4269250^2 .
It is a cyclic number.
It is not a de Polignac number, because 323030222122141 - 25 = 323030222122109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323030222132141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161515111061070 + 161515111061071.
It is an arithmetic number, because the mean of its divisors is an integer number (161515111061071).
Almost surely, 2323030222122141 is an apocalyptic number.
It is an amenable number.
323030222122141 is a deficient number, since it is larger than the sum of its proper divisors (1).
323030222122141 is an equidigital number, since it uses as much as digits as its factorization.
323030222122141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 323030222122141 its reverse (141221222030323), we get a palindrome (464251444152464).
The spelling of 323030222122141 in words is "three hundred twenty-three trillion, thirty billion, two hundred twenty-two million, one hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •