Base | Representation |
---|---|
bin | 1011101100110010110… |
… | …1111110110010000001 |
3 | 201012211020210111210220 |
4 | 2323030231332302001 |
5 | 11243123243220223 |
6 | 232201202013253 |
7 | 20344021112430 |
oct | 2731455766201 |
9 | 635736714726 |
10 | 201003101313 |
11 | 78277013053 |
12 | 32b57647229 |
13 | 15c540a3b51 |
14 | 9a2b3d9117 |
15 | 53665696e3 |
hex | 2eccb7ec81 |
201003101313 has 8 divisors (see below), whose sum is σ = 306290440128. Its totient is φ = 114858915024.
The previous prime is 201003101311. The next prime is 201003101317. The reversal of 201003101313 is 313101300102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201003101313 - 21 = 201003101311 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201003101292 and 201003101301.
It is not an unprimeable number, because it can be changed into a prime (201003101311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4785788106 + ... + 4785788147.
It is an arithmetic number, because the mean of its divisors is an integer number (38286305016).
Almost surely, 2201003101313 is an apocalyptic number.
It is an amenable number.
201003101313 is a deficient number, since it is larger than the sum of its proper divisors (105287338815).
201003101313 is an equidigital number, since it uses as much as digits as its factorization.
201003101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9571576263.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 201003101313 its reverse (313101300102), we get a palindrome (514104401415).
The spelling of 201003101313 in words is "two hundred one billion, three million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •