Base | Representation |
---|---|
bin | 111100010010110100001011… |
… | …1001010000010000010011110 |
3 | 2120112211010000201002100111010 |
4 | 1320211220113022002002132 |
5 | 1024003234423234303210 |
6 | 5115544044542240050 |
7 | 216465430366462635 |
oct | 17045502712020236 |
9 | 2515733021070433 |
10 | 530351540150430 |
11 | 143a939091a6a69 |
12 | 4b595821886026 |
13 | 199c0c217b096b |
14 | 94d7219a3051c |
15 | 414a9d9a56920 |
hex | 1e25a1728209e |
530351540150430 has 64 divisors (see below), whose sum is σ = 1275694863105600. Its totient is φ = 141110289137664.
The previous prime is 530351540150407. The next prime is 530351540150441. The reversal of 530351540150430 is 34051045153035.
It is a super-2 number, since 2×5303515401504302 (a number of 30 digits) contains 22 as substring.
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, 1302305002 + ... + 1302712178.
It is an arithmetic number, because the mean of its divisors is an integer number (19932732236025).
Almost surely, 2530351540150430 is an apocalyptic number.
530351540150430 is an abundant number, since it is smaller than the sum of its proper divisors (745343322955170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530351540150430 is a wasteful number, since it uses less digits than its factorization.
530351540150430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504333.
The product of its (nonzero) digits is 270000, while the sum is 39.
The spelling of 530351540150430 in words is "five hundred thirty trillion, three hundred fifty-one billion, five hundred forty million, one hundred fifty thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •