Base | Representation |
---|---|
bin | 100100110001010110100001… |
… | …0000111000100101000110011 |
3 | 1120102012202212211021110200111 |
4 | 1021202231002013010220303 |
5 | 314343234122043411011 |
6 | 3103523144533002151 |
7 | 125061633342054154 |
oct | 11142550207045063 |
9 | 1512182784243614 |
10 | 323442211310131 |
11 | 94071087188701 |
12 | 30339326183357 |
13 | 10b62614a9a964 |
14 | 59c2987c9d92b |
15 | 275d71a51c121 |
hex | 1262b421c4a33 |
323442211310131 has 2 divisors, whose sum is σ = 323442211310132. Its totient is φ = 323442211310130.
The previous prime is 323442211310081. The next prime is 323442211310137. The reversal of 323442211310131 is 131013112244323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323442211310131 - 219 = 323442210785843 is a prime.
It is a super-2 number, since 2×3234422113101312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323442211310093 and 323442211310102.
It is not a weakly prime, because it can be changed into another prime (323442211310137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161721105655065 + 161721105655066.
It is an arithmetic number, because the mean of its divisors is an integer number (161721105655066).
Almost surely, 2323442211310131 is an apocalyptic number.
323442211310131 is a deficient number, since it is larger than the sum of its proper divisors (1).
323442211310131 is an equidigital number, since it uses as much as digits as its factorization.
323442211310131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 323442211310131 its reverse (131013112244323), we get a palindrome (454455323554454).
The spelling of 323442211310131 in words is "three hundred twenty-three trillion, four hundred forty-two billion, two hundred eleven million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •