Base | Representation |
---|---|
bin | 100111100000100… |
… | …0101111100000010 |
3 | 10102101111212001010 |
4 | 1033001011330002 |
5 | 10203333432110 |
6 | 335314021350 |
7 | 44565102210 |
oct | 11701057402 |
9 | 3371455033 |
10 | 1325686530 |
11 | 620351a03 |
12 | 30bb77856 |
13 | 18185c7cc |
14 | c80c9cb0 |
15 | 7b5b6020 |
hex | 4f045f02 |
1325686530 has 64 divisors (see below), whose sum is σ = 3656586240. Its totient is φ = 301312704.
The previous prime is 1325686513. The next prime is 1325686543. The reversal of 1325686530 is 356865231.
It is a Curzon number.
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 31 ways as a sum of consecutive naturals, for example, 19957 + ... + 55223.
It is an arithmetic number, because the mean of its divisors is an integer number (57134160).
Almost surely, 21325686530 is an apocalyptic number.
1325686530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1325686530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1828293120).
1325686530 is an abundant number, since it is smaller than the sum of its proper divisors (2330899710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1325686530 is a wasteful number, since it uses less digits than its factorization.
1325686530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35463.
The product of its (nonzero) digits is 129600, while the sum is 39.
The square root of 1325686530 is about 36409.9784399826. The cubic root of 1325686530 is about 1098.5342820006.
The spelling of 1325686530 in words is "one billion, three hundred twenty-five million, six hundred eighty-six thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •