Base | Representation |
---|---|
bin | 101110110000101001011… |
… | …001101000101000110001 |
3 | 102101012011111112101110101 |
4 | 232300221121220220301 |
5 | 410121400002421223 |
6 | 10500103344232401 |
7 | 451104213246262 |
oct | 56605131505061 |
9 | 12335144471411 |
10 | 3213330123313 |
11 | 10298470a0912 |
12 | 43a92190b701 |
13 | 1a40287379bb |
14 | b1751518969 |
15 | 588bd0c94ad |
hex | 2ec29668a31 |
3213330123313 has 8 divisors (see below), whose sum is σ = 3222681840000. Its totient is φ = 3203979232848.
The previous prime is 3213330123301. The next prime is 3213330123343. The reversal of 3213330123313 is 3133210333123.
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 3213330123313 - 229 = 3212793252401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3213330123343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8063838 + ... + 8452936.
It is an arithmetic number, because the mean of its divisors is an integer number (402835230000).
Almost surely, 23213330123313 is an apocalyptic number.
It is an amenable number.
3213330123313 is a deficient number, since it is larger than the sum of its proper divisors (9351716687).
3213330123313 is a wasteful number, since it uses less digits than its factorization.
3213330123313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413111.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 3213330123313 its reverse (3133210333123), we get a palindrome (6346540456436).
The spelling of 3213330123313 in words is "three trillion, two hundred thirteen billion, three hundred thirty million, one hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •