Base | Representation |
---|---|
bin | 1011101010001101101… |
… | …1001100010110101001 |
3 | 201011000222012002012222 |
4 | 2322203123030112221 |
5 | 11240213414412223 |
6 | 232004333043425 |
7 | 20320606354541 |
oct | 2724333142651 |
9 | 634028162188 |
10 | 200310310313 |
11 | 77a50a47a03 |
12 | 329a3626575 |
13 | 15b736b9b49 |
14 | 99a33ba321 |
15 | 532581d0c8 |
hex | 2ea36cc5a9 |
200310310313 has 2 divisors, whose sum is σ = 200310310314. Its totient is φ = 200310310312.
The previous prime is 200310310307. The next prime is 200310310331. The reversal of 200310310313 is 313013013002.
Together with next prime (200310310331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 165297538624 + 35012771689 = 406568^2 + 187117^2 .
It is a cyclic number.
It is not a de Polignac number, because 200310310313 - 222 = 200306116009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200310310291 and 200310310300.
It is not a weakly prime, because it can be changed into another prime (200310310363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100155155156 + 100155155157.
It is an arithmetic number, because the mean of its divisors is an integer number (100155155157).
Almost surely, 2200310310313 is an apocalyptic number.
It is an amenable number.
200310310313 is a deficient number, since it is larger than the sum of its proper divisors (1).
200310310313 is an equidigital number, since it uses as much as digits as its factorization.
200310310313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 200310310313 its reverse (313013013002), we get a palindrome (513323323315).
The spelling of 200310310313 in words is "two hundred billion, three hundred ten million, three hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •