Base | Representation |
---|---|
bin | 1111011101100001001… |
… | …01001011001001010001 |
3 | 1212210020021101120221111 |
4 | 13232300211023021101 |
5 | 32200441314344101 |
6 | 1044014440053321 |
7 | 53244465230650 |
oct | 7566045131121 |
9 | 1783207346844 |
10 | 531243512401 |
11 | 195332127828 |
12 | 86b60464241 |
13 | 3b133030814 |
14 | 1b9d8887197 |
15 | dc439e0251 |
hex | 7bb094b251 |
531243512401 has 4 divisors (see below), whose sum is σ = 607135442752. Its totient is φ = 455351582052.
The previous prime is 531243512363. The next prime is 531243512413. The reversal of 531243512401 is 104215342135.
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 531243512401 - 237 = 393804558929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (531243512491) 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 in 3 ways as a sum of consecutive naturals, for example, 37945965165 + ... + 37945965178.
It is an arithmetic number, because the mean of its divisors is an integer number (151783860688).
Almost surely, 2531243512401 is an apocalyptic number.
It is an amenable number.
531243512401 is a deficient number, since it is larger than the sum of its proper divisors (75891930351).
531243512401 is an equidigital number, since it uses as much as digits as its factorization.
531243512401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75891930350.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 531243512401 its reverse (104215342135), we get a palindrome (635458854536).
The spelling of 531243512401 in words is "five hundred thirty-one billion, two hundred forty-three million, five hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •