Base | Representation |
---|---|
bin | 100100110000010100010010… |
… | …1101101110101010110111011 |
3 | 1120101201011210221111202201101 |
4 | 1021200220211231311112323 |
5 | 314333421400224324011 |
6 | 3103333545312432231 |
7 | 125045440261342354 |
oct | 11140504555652673 |
9 | 1511634727452641 |
10 | 323300001011131 |
11 | 94016840180181 |
12 | 30315858248677 |
13 | 10b520a030c641 |
14 | 59b9b36cb2d2b |
15 | 2759b957472c1 |
hex | 1260a25b755bb |
323300001011131 has 2 divisors, whose sum is σ = 323300001011132. Its totient is φ = 323300001011130.
The previous prime is 323300001011087. The next prime is 323300001011137. The reversal of 323300001011131 is 131110100003323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323300001011131 - 227 = 323299866793403 is a prime.
It is a super-2 number, since 2×3233000010111312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323300001011099 and 323300001011108.
It is not a weakly prime, because it can be changed into another prime (323300001011137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161650000505565 + 161650000505566.
It is an arithmetic number, because the mean of its divisors is an integer number (161650000505566).
Almost surely, 2323300001011131 is an apocalyptic number.
323300001011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
323300001011131 is an equidigital number, since it uses as much as digits as its factorization.
323300001011131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 323300001011131 its reverse (131110100003323), we get a palindrome (454410101014454).
The spelling of 323300001011131 in words is "three hundred twenty-three trillion, three hundred billion, one million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •