Base | Representation |
---|---|
bin | 101111010011001100111… |
… | …011001101101001000101 |
3 | 102111201221021210121022021 |
4 | 233103030323031221011 |
5 | 411223341414201323 |
6 | 10525121203203141 |
7 | 453556524416410 |
oct | 57231473155105 |
9 | 12451837717267 |
10 | 3250433350213 |
11 | 10435569843a5 |
12 | 445b576764b1 |
13 | 1a768c60922a |
14 | b34710b0b77 |
15 | 5984060d05d |
hex | 2f4ccecda45 |
3250433350213 has 8 divisors (see below), whose sum is σ = 3731002724480. Its totient is φ = 2773919414160.
The previous prime is 3250433350187. The next prime is 3250433350217. The reversal of 3250433350213 is 3120533340523.
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 3250433350213 - 29 = 3250433349701 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 (3250433350217) 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, 1013857833 + ... + 1013861038.
It is an arithmetic number, because the mean of its divisors is an integer number (466375340560).
Almost surely, 23250433350213 is an apocalyptic number.
It is an amenable number.
3250433350213 is a deficient number, since it is larger than the sum of its proper divisors (480569374267).
3250433350213 is a wasteful number, since it uses less digits than its factorization.
3250433350213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2027719107.
The product of its (nonzero) digits is 97200, while the sum is 34.
Adding to 3250433350213 its reverse (3120533340523), we get a palindrome (6370966690736).
The spelling of 3250433350213 in words is "three trillion, two hundred fifty billion, four hundred thirty-three million, three hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •