Base | Representation |
---|---|
bin | 1011010011001100… |
… | …1001000010001001 |
3 | 21211101200212111222 |
4 | 2310303021002021 |
5 | 22203011231400 |
6 | 1220554131425 |
7 | 135111445316 |
oct | 26463110211 |
9 | 7741625458 |
10 | 3033305225 |
11 | 1317249125 |
12 | 707a20b75 |
13 | 394575a82 |
14 | 20abd5d0d |
15 | 12b472185 |
hex | b4cc9089 |
3033305225 has 12 divisors (see below), whose sum is σ = 3798542220. Its totient is φ = 2402616000.
The previous prime is 3033305213. The next prime is 3033305273. The reversal of 3033305225 is 5225033303.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 96098809 + 2937206416 = 9803^2 + 54196^2 .
It is not a de Polignac number, because 3033305225 - 228 = 2764869769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3033305194 and 3033305203.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 598130 + ... + 603179.
It is an arithmetic number, because the mean of its divisors is an integer number (316545185).
Almost surely, 23033305225 is an apocalyptic number.
It is an amenable number.
3033305225 is a deficient number, since it is larger than the sum of its proper divisors (765236995).
3033305225 is a wasteful number, since it uses less digits than its factorization.
3033305225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201420 (or 1201415 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 26.
The square root of 3033305225 is about 55075.4502932114. The cubic root of 3033305225 is about 1447.5671013505.
Adding to 3033305225 its reverse (5225033303), we get a palindrome (8258338528).
The spelling of 3033305225 in words is "three billion, thirty-three million, three hundred five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •