Base | Representation |
---|---|
bin | 100111100000011… |
… | …0010010011101000 |
3 | 10102101100202201222 |
4 | 1033000302103220 |
5 | 10203323343440 |
6 | 335312201212 |
7 | 44564315606 |
oct | 11700622350 |
9 | 3371322658 |
10 | 1325606120 |
11 | 6202a7553 |
12 | 30bb39208 |
13 | 181832027 |
14 | c80a8876 |
15 | 7b59c2b5 |
hex | 4f0324e8 |
1325606120 has 16 divisors (see below), whose sum is σ = 2982613860. Its totient is φ = 530242432.
The previous prime is 1325606057. The next prime is 1325606123. The reversal of 1325606120 is 216065231.
It can be written as a sum of positive squares in 2 ways, for example, as 1302776836 + 22829284 = 36094^2 + 4778^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1325606120.
It is not an unprimeable number, because it can be changed into a prime (1325606123) 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 3 ways as a sum of consecutive naturals, for example, 16570037 + ... + 16570116.
Almost surely, 21325606120 is an apocalyptic number.
1325606120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1325606120 is an abundant number, since it is smaller than the sum of its proper divisors (1657007740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1325606120 is a wasteful number, since it uses less digits than its factorization.
1325606120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33140164 (or 33140160 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 1325606120 is about 36408.8741929766. The cubic root of 1325606120 is about 1098.5120708857.
The spelling of 1325606120 in words is "one billion, three hundred twenty-five million, six hundred six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •