Base | Representation |
---|---|
bin | 1111011011110011100… |
… | …11000101011110101011 |
3 | 1212200212012221110200011 |
4 | 13231321303011132223 |
5 | 32142101022143311 |
6 | 1043343324352351 |
7 | 53212635061630 |
oct | 7557163053653 |
9 | 1780765843604 |
10 | 530324412331 |
11 | 194a0033a29a |
12 | 869446a56b7 |
13 | 3b0177aa51c |
14 | 1b94c798187 |
15 | dbdce8e321 |
hex | 7b79cc57ab |
530324412331 has 8 divisors (see below), whose sum is σ = 606163785984. Its totient is φ = 454504724520.
The previous prime is 530324412301. The next prime is 530324412337. The reversal of 530324412331 is 133214423035.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 530324412331 - 211 = 530324410283 is a prime.
It is a super-2 number, since 2×5303244123312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530324412293 and 530324412302.
It is not an unprimeable number, because it can be changed into a prime (530324412337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4863685 + ... + 4971526.
It is an arithmetic number, because the mean of its divisors is an integer number (75770473248).
Almost surely, 2530324412331 is an apocalyptic number.
530324412331 is a deficient number, since it is larger than the sum of its proper divisors (75839373653).
530324412331 is an equidigital number, since it uses as much as digits as its factorization.
530324412331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9842921.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 530324412331 its reverse (133214423035), we get a palindrome (663538835366).
The spelling of 530324412331 in words is "five hundred thirty billion, three hundred twenty-four million, four hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •