Base | Representation |
---|---|
bin | 11101000111110110110… |
… | …110101000101000111101 |
3 | 21002022201010111020201020 |
4 | 131013312312220220331 |
5 | 230242131113410023 |
6 | 4131215104334353 |
7 | 264406053312555 |
oct | 35076666505075 |
9 | 7068633436636 |
10 | 2001301310013 |
11 | 701824463305 |
12 | 283a479143b9 |
13 | 11695003a6b5 |
14 | 6cc13632165 |
15 | 370d237ade3 |
hex | 1d1f6da8a3d |
2001301310013 has 4 divisors (see below), whose sum is σ = 2668401746688. Its totient is φ = 1334200873340.
The previous prime is 2001301310011. The next prime is 2001301310077. The reversal of 2001301310013 is 3100131031002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2001301310013 - 21 = 2001301310011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2001301309974 and 2001301310001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001301310011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 333550218333 + ... + 333550218338.
It is an arithmetic number, because the mean of its divisors is an integer number (667100436672).
Almost surely, 22001301310013 is an apocalyptic number.
It is an amenable number.
2001301310013 is a deficient number, since it is larger than the sum of its proper divisors (667100436675).
2001301310013 is an equidigital number, since it uses as much as digits as its factorization.
2001301310013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 667100436674.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2001301310013 its reverse (3100131031002), we get a palindrome (5101432341015).
The spelling of 2001301310013 in words is "two trillion, one billion, three hundred one million, three hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •