Base | Representation |
---|---|
bin | 110000001101011110010… |
… | …111100011111011100001 |
3 | 102201201102212200011022121 |
4 | 300031132113203323201 |
5 | 413240012233120001 |
6 | 11013550024304241 |
7 | 461233206012643 |
oct | 60153627437341 |
9 | 12651385604277 |
10 | 3313003020001 |
11 | 10680449203a4 |
12 | 4560ba012081 |
13 | 1b0551549c8c |
14 | b64c8d4c893 |
15 | 5b2a374e6a1 |
hex | 3035e5e3ee1 |
3313003020001 has 4 divisors (see below), whose sum is σ = 3334943437504. Its totient is φ = 3291062602500.
The previous prime is 3313003019993. The next prime is 3313003020011. The reversal of 3313003020001 is 1000203003133.
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 3313003020001 - 23 = 3313003019993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3313003020011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10970208525 + ... + 10970208826.
It is an arithmetic number, because the mean of its divisors is an integer number (833735859376).
Almost surely, 23313003020001 is an apocalyptic number.
It is an amenable number.
3313003020001 is a deficient number, since it is larger than the sum of its proper divisors (21940417503).
3313003020001 is a wasteful number, since it uses less digits than its factorization.
3313003020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21940417502.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 3313003020001 its reverse (1000203003133), we get a palindrome (4313206023134).
The spelling of 3313003020001 in words is "three trillion, three hundred thirteen billion, three million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •