Base | Representation |
---|---|
bin | 10011010000010… |
… | …101110000100010 |
3 | 211111212200000110 |
4 | 103100111300202 |
5 | 1130200104110 |
6 | 52020032150 |
7 | 11001612165 |
oct | 2320256042 |
9 | 744780013 |
10 | 323050530 |
11 | 156398710 |
12 | 90232656 |
13 | 51c0b87a |
14 | 30c93adc |
15 | 1d563a20 |
hex | 13415c22 |
323050530 has 64 divisors (see below), whose sum is σ = 847656576. Its totient is φ = 78144000.
The previous prime is 323050499. The next prime is 323050543. The reversal of 323050530 is 35050323.
It is a junction number, because it is equal to n+sod(n) for n = 323050497 and 323050506.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 217390 + ... + 218870.
It is an arithmetic number, because the mean of its divisors is an integer number (13244634).
Almost surely, 2323050530 is an apocalyptic number.
323050530 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 323050530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (423828288).
323050530 is an abundant number, since it is smaller than the sum of its proper divisors (524606046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323050530 is a wasteful number, since it uses less digits than its factorization.
323050530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2163.
The product of its (nonzero) digits is 1350, while the sum is 21.
The square root of 323050530 is about 17973.6064828403. The cubic root of 323050530 is about 686.1569805672.
The spelling of 323050530 in words is "three hundred twenty-three million, fifty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •