Base | Representation |
---|---|
bin | 1001101000110001110… |
… | …01111001100110101011 |
3 | 1011122201001002210020112 |
4 | 10310120321321212223 |
5 | 20411123330010011 |
6 | 412041423444535 |
7 | 32631501135632 |
oct | 4643071714653 |
9 | 1148631083215 |
10 | 331130313131 |
11 | 11848247a312 |
12 | 54212a5674b |
13 | 252c1429037 |
14 | 1205373a519 |
15 | 893065a58b |
hex | 4d18e799ab |
331130313131 has 4 divisors (see below), whose sum is σ = 333323229264. Its totient is φ = 328937397000.
The previous prime is 331130313049. The next prime is 331130313133. The reversal of 331130313131 is 131313031133.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 331130313131 - 214 = 331130296747 is a prime.
It is a super-2 number, since 2×3311303131312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331130313097 and 331130313106.
It is not an unprimeable number, because it can be changed into a prime (331130313133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1096457840 + ... + 1096458141.
It is an arithmetic number, because the mean of its divisors is an integer number (83330807316).
Almost surely, 2331130313131 is an apocalyptic number.
331130313131 is a deficient number, since it is larger than the sum of its proper divisors (2192916133).
331130313131 is a wasteful number, since it uses less digits than its factorization.
331130313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2192916132.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 331130313131 its reverse (131313031133), we get a palindrome (462443344264).
The spelling of 331130313131 in words is "three hundred thirty-one billion, one hundred thirty million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •