Base | Representation |
---|---|
bin | 10010101100011… |
… | …001110110110101 |
3 | 210212011001122212 |
4 | 102230121312311 |
5 | 1120242131013 |
6 | 51042103205 |
7 | 10525545365 |
oct | 2254316665 |
9 | 725131585 |
10 | 313630133 |
11 | 151043a63 |
12 | 8904ab05 |
13 | 4cc90a7b |
14 | 2d9209a5 |
15 | 1c8026a8 |
hex | 12b19db5 |
313630133 has 2 divisors, whose sum is σ = 313630134. Its totient is φ = 313630132.
The previous prime is 313630129. The next prime is 313630147. The reversal of 313630133 is 331036313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 292854769 + 20775364 = 17113^2 + 4558^2 .
It is an emirp because it is prime and its reverse (331036313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 313630133 - 22 = 313630129 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 313630099 and 313630108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313630123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156815066 + 156815067.
It is an arithmetic number, because the mean of its divisors is an integer number (156815067).
Almost surely, 2313630133 is an apocalyptic number.
It is an amenable number.
313630133 is a deficient number, since it is larger than the sum of its proper divisors (1).
313630133 is an equidigital number, since it uses as much as digits as its factorization.
313630133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
The square root of 313630133 is about 17709.6056703700. The cubic root of 313630133 is about 679.4214607772.
Adding to 313630133 its reverse (331036313), we get a palindrome (644666446).
The spelling of 313630133 in words is "three hundred thirteen million, six hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •