Base | Representation |
---|---|
bin | 10010101010100… |
… | …000010001100101 |
3 | 210211012202112102 |
4 | 102222200101211 |
5 | 1120130212013 |
6 | 51023301445 |
7 | 10521402446 |
oct | 2252402145 |
9 | 724182472 |
10 | 313132133 |
11 | 150833896 |
12 | 88a4a885 |
13 | 4cb481b2 |
14 | 2d8312cd |
15 | 1c754d58 |
hex | 12aa0465 |
313132133 has 4 divisors (see below), whose sum is σ = 313595340. Its totient is φ = 312668928.
The previous prime is 313132123. The next prime is 313132139. The reversal of 313132133 is 331231313.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 214388164 + 98743969 = 14642^2 + 9937^2 .
It is a cyclic number.
It is not a de Polignac number, because 313132133 - 24 = 313132117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313132139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 230588 + ... + 231941.
It is an arithmetic number, because the mean of its divisors is an integer number (78398835).
Almost surely, 2313132133 is an apocalyptic number.
It is an amenable number.
313132133 is a deficient number, since it is larger than the sum of its proper divisors (463207).
313132133 is an equidigital number, since it uses as much as digits as its factorization.
313132133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463206.
The product of its digits is 486, while the sum is 20.
The square root of 313132133 is about 17695.5399182958. The cubic root of 313132133 is about 679.0616620898.
Adding to 313132133 its reverse (331231313), we get a palindrome (644363446).
The spelling of 313132133 in words is "three hundred thirteen million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •