Base | Representation |
---|---|
bin | 1111011100001100001… |
… | …00010011101011110001 |
3 | 1212201101120021021202010 |
4 | 13232012010103223301 |
5 | 32143011221103203 |
6 | 1043420000313133 |
7 | 53221014515046 |
oct | 7560604235361 |
9 | 1781346237663 |
10 | 530530253553 |
11 | 194aa6551903 |
12 | 869a16127a9 |
13 | 3b04b32b471 |
14 | 1b96bc5b1cd |
15 | dc0109e303 |
hex | 7b86113af1 |
530530253553 has 4 divisors (see below), whose sum is σ = 707373671408. Its totient is φ = 353686835700.
The previous prime is 530530253489. The next prime is 530530253569. The reversal of 530530253553 is 355352035035.
530530253553 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 530530253553 - 26 = 530530253489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530530253593) 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, 88421708923 + ... + 88421708928.
It is an arithmetic number, because the mean of its divisors is an integer number (176843417852).
Almost surely, 2530530253553 is an apocalyptic number.
It is an amenable number.
530530253553 is a deficient number, since it is larger than the sum of its proper divisors (176843417855).
530530253553 is a wasteful number, since it uses less digits than its factorization.
530530253553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176843417854.
The product of its (nonzero) digits is 506250, while the sum is 39.
Adding to 530530253553 its reverse (355352035035), we get a palindrome (885882288588).
The spelling of 530530253553 in words is "five hundred thirty billion, five hundred thirty million, two hundred fifty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •