Base | Representation |
---|---|
bin | 1111011101100110110… |
… | …01111110111011100000 |
3 | 1212210100120120122211010 |
4 | 13232303121332323200 |
5 | 32201040433113212 |
6 | 1044023252020520 |
7 | 53245612140432 |
oct | 7566331767340 |
9 | 1783316518733 |
10 | 531290910432 |
11 | 195356960657 |
12 | 86b74301740 |
13 | 3b13cab77a9 |
14 | 1ba00ca4652 |
15 | dc47c5403c |
hex | 7bb367eee0 |
531290910432 has 96 divisors (see below), whose sum is σ = 1477738080000. Its totient is φ = 166559643648.
The previous prime is 531290910419. The next prime is 531290910433. The reversal of 531290910432 is 234019092135.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (531290910433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2166819 + ... + 2399517.
It is an arithmetic number, because the mean of its divisors is an integer number (15393105000).
Almost surely, 2531290910432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 531290910432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (738869040000).
531290910432 is an abundant number, since it is smaller than the sum of its proper divisors (946447169568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
531290910432 is a wasteful number, since it uses less digits than its factorization.
531290910432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234128 (or 234120 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 39.
The spelling of 531290910432 in words is "five hundred thirty-one billion, two hundred ninety million, nine hundred ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •