Base | Representation |
---|---|
bin | 110000000010011110111… |
… | …111011110001001011101 |
3 | 102200120222110120120221011 |
4 | 300002132333132021131 |
5 | 413041330243301023 |
6 | 11004315034335221 |
7 | 460334604515431 |
oct | 60023677361135 |
9 | 12616873516834 |
10 | 3301202322013 |
11 | 1063039715332 |
12 | 453965b8a511 |
13 | 1ac3c0786b4b |
14 | b5ac99b09c1 |
15 | 5ad1274b50d |
hex | 3009efde25d |
3301202322013 has 8 divisors (see below), whose sum is σ = 3335325295232. Its totient is φ = 3267081184896.
The previous prime is 3301202322007. The next prime is 3301202322029. The reversal of 3301202322013 is 3102232021033.
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 3301202322013 - 25 = 3301202321981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3301202322073) 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 7 ways as a sum of consecutive naturals, for example, 3314956 + ... + 4194202.
It is an arithmetic number, because the mean of its divisors is an integer number (416915661904).
Almost surely, 23301202322013 is an apocalyptic number.
It is an amenable number.
3301202322013 is a deficient number, since it is larger than the sum of its proper divisors (34122973219).
3301202322013 is an equidigital number, since it uses as much as digits as its factorization.
3301202322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918051.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 3301202322013 its reverse (3102232021033), we get a palindrome (6403434343046).
The spelling of 3301202322013 in words is "three trillion, three hundred one billion, two hundred two million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •