Base | Representation |
---|---|
bin | 111100011001110100000011… |
… | …1101001000110010000010100 |
3 | 2120200020001122001202210222111 |
4 | 1320303220013221012100110 |
5 | 1024120014221222024022 |
6 | 5122001552355440404 |
7 | 216625060115030260 |
oct | 17063500751062024 |
9 | 2520201561683874 |
10 | 531313352533012 |
11 | 144324800215765 |
12 | 4b7101068b6104 |
13 | 19a6083233117a |
14 | 952b9bc4870a0 |
15 | 4165a2d988477 |
hex | 1e33a07a46414 |
531313352533012 has 96 divisors (see below), whose sum is σ = 1092525364740096. Its totient is φ = 221365886774400.
The previous prime is 531313352533009. The next prime is 531313352533031. The reversal of 531313352533012 is 210335253313135.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 302629837 + ... + 304380427.
It is an arithmetic number, because the mean of its divisors is an integer number (11380472549376).
Almost surely, 2531313352533012 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 531313352533012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (546262682370048).
531313352533012 is an abundant number, since it is smaller than the sum of its proper divisors (561212012207084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
531313352533012 is a wasteful number, since it uses less digits than its factorization.
531313352533012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1752197 (or 1752195 counting only the distinct ones).
The product of its (nonzero) digits is 364500, while the sum is 40.
The spelling of 531313352533012 in words is "five hundred thirty-one trillion, three hundred thirteen billion, three hundred fifty-two million, five hundred thirty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •