Base | Representation |
---|---|
bin | 1100010010110010… |
… | …0011000100011001 |
3 | 22111222112222212021 |
4 | 3010230203010121 |
5 | 23224300343223 |
6 | 1303242414441 |
7 | 144530433103 |
oct | 30454430431 |
9 | 8458488767 |
10 | 3300012313 |
11 | 1443853104 |
12 | 781201421 |
13 | 4078b7b10 |
14 | 2343c0573 |
15 | 144aa665d |
hex | c4b23119 |
3300012313 has 4 divisors (see below), whose sum is σ = 3553859428. Its totient is φ = 3046165200.
The previous prime is 3300012311. The next prime is 3300012329. The reversal of 3300012313 is 3132100033.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2015291664 + 1284720649 = 44892^2 + 35843^2 .
It is not a de Polignac number, because 3300012313 - 21 = 3300012311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3300012311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126923538 + ... + 126923563.
It is an arithmetic number, because the mean of its divisors is an integer number (888464857).
Almost surely, 23300012313 is an apocalyptic number.
It is an amenable number.
3300012313 is a deficient number, since it is larger than the sum of its proper divisors (253847115).
3300012313 is a wasteful number, since it uses less digits than its factorization.
3300012313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253847114.
The product of its (nonzero) digits is 162, while the sum is 16.
The square root of 3300012313 is about 57445.7336361892. The cubic root of 3300012313 is about 1488.8074046346.
Adding to 3300012313 its reverse (3132100033), we get a palindrome (6432112346).
The spelling of 3300012313 in words is "three billion, three hundred million, twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •