Base | Representation |
---|---|
bin | 1001000111011000011… |
… | …11011011001111110011 |
3 | 1002221102112011000002002 |
4 | 10203230033123033303 |
5 | 20112413441041201 |
6 | 355514350444215 |
7 | 31425262345442 |
oct | 4435417331763 |
9 | 1087375130062 |
10 | 313201112051 |
11 | 110911954163 |
12 | 5084a50366b |
13 | 236c4a86b09 |
14 | 1123249cd59 |
15 | 82315d976b |
hex | 48ec3db3f3 |
313201112051 has 2 divisors, whose sum is σ = 313201112052. Its totient is φ = 313201112050.
The previous prime is 313201112023. The next prime is 313201112053. The reversal of 313201112051 is 150211102313.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313201112051 is a prime.
It is a Sophie Germain prime.
Together with 313201112053, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (313201112053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156600556025 + 156600556026.
It is an arithmetic number, because the mean of its divisors is an integer number (156600556026).
Almost surely, 2313201112051 is an apocalyptic number.
313201112051 is a deficient number, since it is larger than the sum of its proper divisors (1).
313201112051 is an equidigital number, since it uses as much as digits as its factorization.
313201112051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 313201112051 its reverse (150211102313), we get a palindrome (463412214364).
The spelling of 313201112051 in words is "three hundred thirteen billion, two hundred one million, one hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •