Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …1001010000000111001 |
3 | 201012211010102121202122 |
4 | 2323030213022000321 |
5 | 11243122313443223 |
6 | 232201055411025 |
7 | 20343666651614 |
oct | 2731447120071 |
9 | 635733377678 |
10 | 201001312313 |
11 | 78276000a3a |
12 | 32b56b23a75 |
13 | 15c538c8779 |
14 | 9a2b09117b |
15 | 53663145c8 |
hex | 2ecc9ca039 |
201001312313 has 2 divisors, whose sum is σ = 201001312314. Its totient is φ = 201001312312.
The previous prime is 201001312307. The next prime is 201001312357. The reversal of 201001312313 is 313213100102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 167807387449 + 33193924864 = 409643^2 + 182192^2 .
It is a cyclic number.
It is not a de Polignac number, because 201001312313 - 24 = 201001312297 is a prime.
It is a super-5 number, since 5×2010013123135 (a number of 58 digits) contains 55555 as substring.
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 = 201001312291 and 201001312300.
It is not a weakly prime, because it can be changed into another prime (201001912313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500656156 + 100500656157.
It is an arithmetic number, because the mean of its divisors is an integer number (100500656157).
Almost surely, 2201001312313 is an apocalyptic number.
It is an amenable number.
201001312313 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001312313 is an equidigital number, since it uses as much as digits as its factorization.
201001312313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201001312313 its reverse (313213100102), we get a palindrome (514214412415).
The spelling of 201001312313 in words is "two hundred one billion, one million, three hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •