Base | Representation |
---|---|
bin | 1100010110001100… |
… | …0100100000011101 |
3 | 22112222110010211000 |
4 | 3011203010200131 |
5 | 23241430230203 |
6 | 1304513020513 |
7 | 145063061643 |
oct | 30543044035 |
9 | 8488403730 |
10 | 3314305053 |
11 | 1450925494 |
12 | 785b54739 |
13 | 40a850567 |
14 | 236261193 |
15 | 145e7b4a3 |
hex | c58c481d |
3314305053 has 16 divisors (see below), whose sum is σ = 4911082240. Its totient is φ = 2209086432.
The previous prime is 3314305003. The next prime is 3314305067. The reversal of 3314305053 is 3505034133.
It is a happy number.
It is not a de Polignac number, because 3314305053 - 221 = 3312207901 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3314305003) 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 15 ways as a sum of consecutive naturals, for example, 171825 + ... + 190137.
It is an arithmetic number, because the mean of its divisors is an integer number (306942640).
Almost surely, 23314305053 is an apocalyptic number.
It is an amenable number.
3314305053 is a deficient number, since it is larger than the sum of its proper divisors (1596777187).
3314305053 is a wasteful number, since it uses less digits than its factorization.
3314305053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25025 (or 25019 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 27.
The square root of 3314305053 is about 57570.0013288171. The cubic root of 3314305053 is about 1490.9537087515.
Adding to 3314305053 its reverse (3505034133), we get a palindrome (6819339186).
The spelling of 3314305053 in words is "three billion, three hundred fourteen million, three hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •