Base | Representation |
---|---|
bin | 1001101001001001101… |
… | …11111101001111011011 |
3 | 1011200020000222100122121 |
4 | 10310210313331033123 |
5 | 20412031232132311 |
6 | 412113400002111 |
7 | 32636460065545 |
oct | 4644467751733 |
9 | 1150200870577 |
10 | 331331130331 |
11 | 118575870243 |
12 | 5426a160337 |
13 | 25323c0b296 |
14 | 12072292695 |
15 | 89430c6b71 |
hex | 4d24dfd3db |
331331130331 has 2 divisors, whose sum is σ = 331331130332. Its totient is φ = 331331130330.
The previous prime is 331331130329. The next prime is 331331130343. The reversal of 331331130331 is 133031133133.
It is a weak prime.
It is an emirp because it is prime and its reverse (133031133133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 331331130331 - 21 = 331331130329 is a prime.
It is a super-2 number, since 2×3313311303312 (a number of 24 digits) contains 22 as substring.
Together with 331331130329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 331331130296 and 331331130305.
It is not a weakly prime, because it can be changed into another prime (331331130371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165665565165 + 165665565166.
It is an arithmetic number, because the mean of its divisors is an integer number (165665565166).
Almost surely, 2331331130331 is an apocalyptic number.
331331130331 is a deficient number, since it is larger than the sum of its proper divisors (1).
331331130331 is an equidigital number, since it uses as much as digits as its factorization.
331331130331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2187, while the sum is 25.
Adding to 331331130331 its reverse (133031133133), we get a palindrome (464362263464).
The spelling of 331331130331 in words is "three hundred thirty-one billion, three hundred thirty-one million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •