Base | Representation |
---|---|
bin | 1111011011110011101… |
… | …01100010100000110101 |
3 | 1212200212021011010222202 |
4 | 13231321311202200311 |
5 | 32142101203234131 |
6 | 1043343350234245 |
7 | 53212643411111 |
oct | 7557165424065 |
9 | 1780767133882 |
10 | 530325055541 |
11 | 194a00739576 |
12 | 86944955985 |
13 | 3b017974218 |
14 | 1b94c8c4741 |
15 | dbdd069bcb |
hex | 7b79d62835 |
530325055541 has 4 divisors (see below), whose sum is σ = 535473842592. Its totient is φ = 525176268492.
The previous prime is 530325055537. The next prime is 530325055543. The reversal of 530325055541 is 145550523035.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 530325055541 - 22 = 530325055537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530325055495 and 530325055504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530325055543) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2574393371 + ... + 2574393576.
It is an arithmetic number, because the mean of its divisors is an integer number (133868460648).
Almost surely, 2530325055541 is an apocalyptic number.
It is an amenable number.
530325055541 is a deficient number, since it is larger than the sum of its proper divisors (5148787051).
530325055541 is a wasteful number, since it uses less digits than its factorization.
530325055541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5148787050.
The product of its (nonzero) digits is 225000, while the sum is 38.
Adding to 530325055541 its reverse (145550523035), we get a palindrome (675875578576).
The spelling of 530325055541 in words is "five hundred thirty billion, three hundred twenty-five million, fifty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •