Base | Representation |
---|---|
bin | 1111011011101000100… |
… | …00101100100110001010 |
3 | 1212200121202010121121012 |
4 | 13231310100230212022 |
5 | 32141403231331214 |
6 | 1043330205243522 |
7 | 53210426324552 |
oct | 7556420544612 |
9 | 1780552117535 |
10 | 530231511434 |
11 | 194962957499 |
12 | 869195635a2 |
13 | 3b001481091 |
14 | 1b9402d4162 |
15 | dbd4c3d03e |
hex | 7b7442c98a |
530231511434 has 4 divisors (see below), whose sum is σ = 795347267154. Its totient is φ = 265115755716.
The previous prime is 530231511427. The next prime is 530231511437. The reversal of 530231511434 is 434115132035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 528783480625 + 1448030809 = 727175^2 + 38053^2 .
It is a super-2 number, since 2×5302315114342 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 530231511434.
It is not an unprimeable number, because it can be changed into a prime (530231511437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132557877857 + ... + 132557877860.
Almost surely, 2530231511434 is an apocalyptic number.
530231511434 is a deficient number, since it is larger than the sum of its proper divisors (265115755720).
530231511434 is a wasteful number, since it uses less digits than its factorization.
530231511434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265115755719.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 530231511434 its reverse (434115132035), we get a palindrome (964346643469).
The spelling of 530231511434 in words is "five hundred thirty billion, two hundred thirty-one million, five hundred eleven thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •