Base | Representation |
---|---|
bin | 100100101110010010000000… |
… | …0011110010001100100000011 |
3 | 1120100201102121100202101220221 |
4 | 1021130210000132101210003 |
5 | 314314330334021113443 |
6 | 3103001233252443511 |
7 | 125016303523136446 |
oct | 11134440036214403 |
9 | 1510642540671827 |
10 | 323020203301123 |
11 | 93a1910a70a409 |
12 | 3028b590619597 |
13 | 10b3189ca650a3 |
14 | 59aa392c7365d |
15 | 275276b961eed |
hex | 125c900791903 |
323020203301123 has 2 divisors, whose sum is σ = 323020203301124. Its totient is φ = 323020203301122.
The previous prime is 323020203301079. The next prime is 323020203301151. The reversal of 323020203301123 is 321103302020323.
It is a strong prime.
It is an emirp because it is prime and its reverse (321103302020323) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323020203301123 is a prime.
It is a super-2 number, since 2×3230202033011232 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (323020203301223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161510101650561 + 161510101650562.
It is an arithmetic number, because the mean of its divisors is an integer number (161510101650562).
Almost surely, 2323020203301123 is an apocalyptic number.
323020203301123 is a deficient number, since it is larger than the sum of its proper divisors (1).
323020203301123 is an equidigital number, since it uses as much as digits as its factorization.
323020203301123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 323020203301123 its reverse (321103302020323), we get a palindrome (644123505321446).
The spelling of 323020203301123 in words is "three hundred twenty-three trillion, twenty billion, two hundred three million, three hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •