Base | Representation |
---|---|
bin | 1111011011110011010… |
… | …11000010110011010011 |
3 | 1212200212001222100212122 |
4 | 13231321223002303103 |
5 | 32142100002213321 |
6 | 1043343211244455 |
7 | 53212611131540 |
oct | 7557153026323 |
9 | 1780761870778 |
10 | 530322304211 |
11 | 1949aa12a447 |
12 | 86943a4972b |
13 | 3b01721cb0b |
14 | 1b94c3a9bc7 |
15 | dbdcbc48ab |
hex | 7b79ac2cd3 |
530322304211 has 4 divisors (see below), whose sum is σ = 606082633392. Its totient is φ = 454561975032.
The previous prime is 530322304189. The next prime is 530322304231. The reversal of 530322304211 is 112403223035.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112403223035 = 5 ⋅22480644607.
It is a cyclic number.
It is not a de Polignac number, because 530322304211 - 210 = 530322303187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530322304231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37880164580 + ... + 37880164593.
It is an arithmetic number, because the mean of its divisors is an integer number (151520658348).
Almost surely, 2530322304211 is an apocalyptic number.
530322304211 is a deficient number, since it is larger than the sum of its proper divisors (75760329181).
530322304211 is an equidigital number, since it uses as much as digits as its factorization.
530322304211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75760329180.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 530322304211 its reverse (112403223035), we get a palindrome (642725527246).
The spelling of 530322304211 in words is "five hundred thirty billion, three hundred twenty-two million, three hundred four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •