Base | Representation |
---|---|
bin | 1001000111010000001… |
… | …11110101011001001101 |
3 | 1002221020201010102011220 |
4 | 10203220013311121031 |
5 | 20112243243410013 |
6 | 355503441433553 |
7 | 31423463124042 |
oct | 4435007653115 |
9 | 1087221112156 |
10 | 313132013133 |
11 | 110886949115 |
12 | 5082b33b8b9 |
13 | 236b3672494 |
14 | 112272331c9 |
15 | 822a4dab23 |
hex | 48e81f564d |
313132013133 has 4 divisors (see below), whose sum is σ = 417509350848. Its totient is φ = 208754675420.
The previous prime is 313132013099. The next prime is 313132013143. The reversal of 313132013133 is 331310231313.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 313132013133 - 26 = 313132013069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313132013143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52188668853 + ... + 52188668858.
It is an arithmetic number, because the mean of its divisors is an integer number (104377337712).
Almost surely, 2313132013133 is an apocalyptic number.
It is an amenable number.
313132013133 is a deficient number, since it is larger than the sum of its proper divisors (104377337715).
313132013133 is a wasteful number, since it uses less digits than its factorization.
313132013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104377337714.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 313132013133 its reverse (331310231313), we get a palindrome (644442244446).
The spelling of 313132013133 in words is "three hundred thirteen billion, one hundred thirty-two million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •