Base | Representation |
---|---|
bin | 1111011100001101101… |
… | …01010111101111100000 |
3 | 1212201102110110201122121 |
4 | 13232012311113233200 |
5 | 32143023014141412 |
6 | 1043421140114024 |
7 | 53221232033464 |
oct | 7560665275740 |
9 | 1781373421577 |
10 | 530543115232 |
11 | 195002836a99 |
12 | 869a5995914 |
13 | 3b050bb2720 |
14 | 1b96d8484a4 |
15 | dc02290107 |
hex | 7b86d57be0 |
530543115232 has 48 divisors (see below), whose sum is σ = 1126707103872. Its totient is φ = 244462533120.
The previous prime is 530543115199. The next prime is 530543115233. The reversal of 530543115232 is 232511345035.
It is a super-3 number, since 3×5305431152323 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530543115233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 798019 + ... + 1303042.
It is an arithmetic number, because the mean of its divisors is an integer number (23473064664).
Almost surely, 2530543115232 is an apocalyptic number.
530543115232 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
530543115232 is an abundant number, since it is smaller than the sum of its proper divisors (596163988640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530543115232 is a wasteful number, since it uses less digits than its factorization.
530543115232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2101691 (or 2101683 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 34.
The spelling of 530543115232 in words is "five hundred thirty billion, five hundred forty-three million, one hundred fifteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •