Base | Representation |
---|---|
bin | 111100010010110100001011… |
… | …1001010011010011110111011 |
3 | 2120112211010000201021102211110 |
4 | 1320211220113022122132323 |
5 | 1024003234423301004210 |
6 | 5115544044544331403 |
7 | 216465430400360562 |
oct | 17045502712323673 |
9 | 2515733021242743 |
10 | 530351540250555 |
11 | 143a93909265211 |
12 | 4b595821913b63 |
13 | 199c0c218173ca |
14 | 94d7219a58bd9 |
15 | 414a9d9a76420 |
hex | 1e25a1729a7bb |
530351540250555 has 32 divisors (see below), whose sum is σ = 853832427022080. Its totient is φ = 281097760993920.
The previous prime is 530351540250541. The next prime is 530351540250647. The reversal of 530351540250555 is 555052045153035.
It is not a de Polignac number, because 530351540250555 - 212 = 530351540246459 is a prime.
It is a super-2 number, since 2×5303515402505552 (a number of 30 digits) contains 22 as substring.
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, 24483085 + ... + 40744625.
It is an arithmetic number, because the mean of its divisors is an integer number (26682263344440).
Almost surely, 2530351540250555 is an apocalyptic number.
530351540250555 is a deficient number, since it is larger than the sum of its proper divisors (323480886771525).
530351540250555 is a wasteful number, since it uses less digits than its factorization.
530351540250555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16275051.
The product of its (nonzero) digits is 5625000, while the sum is 48.
The spelling of 530351540250555 in words is "five hundred thirty trillion, three hundred fifty-one billion, five hundred forty million, two hundred fifty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •