Base | Representation |
---|---|
bin | 111011101001001… |
… | …1110010001110001 |
3 | 12011110212011102222 |
4 | 1313102132101301 |
5 | 13044320100223 |
6 | 530331250425 |
7 | 100411015112 |
oct | 16722362161 |
9 | 5143764388 |
10 | 2001331313 |
11 | 937776923 |
12 | 47a2a9a15 |
13 | 25b822317 |
14 | 14db24209 |
15 | baa770c8 |
hex | 7749e471 |
2001331313 has 8 divisors (see below), whose sum is σ = 2121823200. Its totient is φ = 1882355328.
The previous prime is 2001331291. The next prime is 2001331331. The reversal of 2001331313 is 3131331002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001331313 - 224 = 1984554097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001331291 and 2001331300.
It is not an unprimeable number, because it can be changed into a prime (2001331333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 376256 + ... + 381537.
It is an arithmetic number, because the mean of its divisors is an integer number (265227900).
Almost surely, 22001331313 is an apocalyptic number.
It is an amenable number.
2001331313 is a deficient number, since it is larger than the sum of its proper divisors (120491887).
2001331313 is a wasteful number, since it uses less digits than its factorization.
2001331313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 757951.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 2001331313 is about 44736.2416056602. The cubic root of 2001331313 is about 1260.2005461000.
Adding to 2001331313 its reverse (3131331002), we get a palindrome (5132662315).
The spelling of 2001331313 in words is "two billion, one million, three hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •