Base | Representation |
---|---|
bin | 111100010010100010111100… |
… | …0100110100100000010010011 |
3 | 2120112200120110201201210212021 |
4 | 1320211011320212210002103 |
5 | 1024002133114200022003 |
6 | 5115515043302512311 |
7 | 216462650120166445 |
oct | 17045057046440223 |
9 | 2515616421653767 |
10 | 530314520314003 |
11 | 143a7a14149aa27 |
12 | 4b58a60ba35697 |
13 | 199ba5a1c88ac9 |
14 | 94d5507184495 |
15 | 4149a6e9e62bd |
hex | 1e251789a4093 |
530314520314003 has 2 divisors, whose sum is σ = 530314520314004. Its totient is φ = 530314520314002.
The previous prime is 530314520313923. The next prime is 530314520314031. The reversal of 530314520314003 is 300413025413035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 530314520314003 - 233 = 530305930379411 is a prime.
It is a super-2 number, since 2×5303145203140032 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 530314520314003.
It is not a weakly prime, because it can be changed into another prime (530314520314303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265157260157001 + 265157260157002.
It is an arithmetic number, because the mean of its divisors is an integer number (265157260157002).
Almost surely, 2530314520314003 is an apocalyptic number.
530314520314003 is a deficient number, since it is larger than the sum of its proper divisors (1).
530314520314003 is an equidigital number, since it uses as much as digits as its factorization.
530314520314003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 530314520314003 its reverse (300413025413035), we get a palindrome (830727545727038).
The spelling of 530314520314003 in words is "five hundred thirty trillion, three hundred fourteen billion, five hundred twenty million, three hundred fourteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •