Base | Representation |
---|---|
bin | 1011010011010001… |
… | …0011001000010101 |
3 | 21211102021021211201 |
4 | 2310310103020111 |
5 | 22203100434400 |
6 | 1221004432501 |
7 | 135114151210 |
oct | 26464231025 |
9 | 7742237751 |
10 | 3033608725 |
11 | 1317436154 |
12 | 707b48731 |
13 | 394650c64 |
14 | 20ac74777 |
15 | 12b4d206a |
hex | b4d13215 |
3033608725 has 48 divisors (see below), whose sum is σ = 4434859008. Its totient is φ = 2014986240.
The previous prime is 3033608719. The next prime is 3033608729. The reversal of 3033608725 is 5278063303.
It is not a de Polignac number, because 3033608725 - 227 = 2899390997 is a prime.
It is a super-2 number, since 2×30336087252 = 18405563792792251250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3033608729) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1663164 + ... + 1664986.
It is an arithmetic number, because the mean of its divisors is an integer number (92392896).
Almost surely, 23033608725 is an apocalyptic number.
3033608725 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3033608725 is a deficient number, since it is larger than the sum of its proper divisors (1401250283).
3033608725 is a wasteful number, since it uses less digits than its factorization.
3033608725 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2134 (or 2129 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 37.
The square root of 3033608725 is about 55078.2055354021. The cubic root of 3033608725 is about 1447.6153789367.
The spelling of 3033608725 in words is "three billion, thirty-three million, six hundred eight thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •