Base | Representation |
---|---|
bin | 111101100101110… |
… | …100100111111100 |
3 | 2200000101100111020 |
4 | 331211310213330 |
5 | 4104012400202 |
6 | 250311424140 |
7 | 34415055324 |
oct | 7545644774 |
9 | 2600340436 |
10 | 1033325052 |
11 | 490315451 |
12 | 24a085050 |
13 | 136107756 |
14 | 9b344284 |
15 | 60ab55bc |
hex | 3d9749fc |
1033325052 has 12 divisors (see below), whose sum is σ = 2411091816. Its totient is φ = 344441680.
The previous prime is 1033324973. The next prime is 1033325063. The reversal of 1033325052 is 2505233301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43055199 + ... + 43055222.
It is an arithmetic number, because the mean of its divisors is an integer number (200924318).
Almost surely, 21033325052 is an apocalyptic number.
1033325052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1033325052 is an abundant number, since it is smaller than the sum of its proper divisors (1377766764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033325052 is a wasteful number, since it uses less digits than its factorization.
1033325052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86110428 (or 86110426 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 24.
The square root of 1033325052 is about 32145.3737262456. The cubic root of 1033325052 is about 1010.9871901997.
Adding to 1033325052 its reverse (2505233301), we get a palindrome (3538558353).
The spelling of 1033325052 in words is "one billion, thirty-three million, three hundred twenty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •