Base | Representation |
---|---|
bin | 100101101001010010111100… |
… | …1100100011111110010111101 |
3 | 1121102102211100000101002010112 |
4 | 1023102211321210133302331 |
5 | 321400223030101332034 |
6 | 3132131313110115405 |
7 | 126514302112040111 |
oct | 11322457144376275 |
9 | 1542384300332115 |
10 | 331131133230269 |
11 | 96565a1a157239 |
12 | 3117b52264bb65 |
13 | 1129c6bb6cb478 |
14 | 5baab92003741 |
15 | 284373245e7ce |
hex | 12d297991fcbd |
331131133230269 has 2 divisors, whose sum is σ = 331131133230270. Its totient is φ = 331131133230268.
The previous prime is 331131133230259. The next prime is 331131133230341. The reversal of 331131133230269 is 962032331131133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 271427107752025 + 59704025478244 = 16475045^2 + 7726838^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331131133230269 is a prime.
It is a super-2 number, since 2×3311311332302692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331131133230259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165565566615134 + 165565566615135.
It is an arithmetic number, because the mean of its divisors is an integer number (165565566615135).
Almost surely, 2331131133230269 is an apocalyptic number.
It is an amenable number.
331131133230269 is a deficient number, since it is larger than the sum of its proper divisors (1).
331131133230269 is an equidigital number, since it uses as much as digits as its factorization.
331131133230269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 157464, while the sum is 41.
The spelling of 331131133230269 in words is "three hundred thirty-one trillion, one hundred thirty-one billion, one hundred thirty-three million, two hundred thirty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •