Base | Representation |
---|---|
bin | 1111100000100110101… |
… | …00001011000100000000 |
3 | 1212221111201100212202001 |
4 | 13300103110023010000 |
5 | 32212334400000000 |
6 | 1044451052233344 |
7 | 53333521155604 |
oct | 7602324130400 |
9 | 1787451325661 |
10 | 532900000000 |
11 | 196002180445 |
12 | 8734316b854 |
13 | 3b3382838b4 |
14 | 1bb14883504 |
15 | dcde14b46a |
hex | 7c1350b100 |
532900000000 has 243 divisors, whose sum is σ = 1348111126173. Its totient is φ = 210240000000.
The previous prime is 532899999859. The next prime is 532900000067. The reversal of 532900000000 is 9235.
The square root of 532900000000 is 730000.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 42317426944 + 490582573056 = 205712^2 + 700416^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 7299999964 + ... + 7300000036.
Almost surely, 2532900000000 is an apocalyptic number.
532900000000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
532900000000 is the 730000-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 532900000000
532900000000 is an abundant number, since it is smaller than the sum of its proper divisors (815211126173).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
532900000000 is an frugal number, since it uses more digits than its factorization.
532900000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202 (or 80 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 532900000000 its reverse (9235), we get a palindrome (532900009235).
The spelling of 532900000000 in words is "five hundred thirty-two billion, nine hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •