Base | Representation |
---|---|
bin | 1100000010110100… |
… | …0010000010101001 |
3 | 22100022111221211110 |
4 | 3000231002002221 |
5 | 23110123432223 |
6 | 1252451020533 |
7 | 143055206232 |
oct | 30055020251 |
9 | 8308457743 |
10 | 3233030313 |
11 | 1409a63587 |
12 | 76289a749 |
13 | 3c6a64bb6 |
14 | 229546089 |
15 | 13dc74d93 |
hex | c0b420a9 |
3233030313 has 8 divisors (see below), whose sum is σ = 4402424448. Its totient is φ = 2109494864.
The previous prime is 3233030309. The next prime is 3233030323. The reversal of 3233030313 is 3130303323.
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 3233030313 - 22 = 3233030309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3233030313.
It is not an unprimeable number, because it can be changed into a prime (3233030323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11464506 + ... + 11464787.
It is an arithmetic number, because the mean of its divisors is an integer number (550303056).
Almost surely, 23233030313 is an apocalyptic number.
It is an amenable number.
3233030313 is a deficient number, since it is larger than the sum of its proper divisors (1169394135).
3233030313 is a wasteful number, since it uses less digits than its factorization.
3233030313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22929343.
The product of its (nonzero) digits is 1458, while the sum is 21.
The square root of 3233030313 is about 56859.7424633633. The cubic root of 3233030313 is about 1478.6654503951.
Adding to 3233030313 its reverse (3130303323), we get a palindrome (6363333636).
The spelling of 3233030313 in words is "three billion, two hundred thirty-three million, thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •