Base | Representation |
---|---|
bin | 1111100010111000100… |
… | …10001011100010000001 |
3 | 1220001200000221102012011 |
4 | 13301130102023202001 |
5 | 32222341244330101 |
6 | 1045212343332521 |
7 | 53406044625031 |
oct | 7613422134201 |
9 | 1801600842164 |
10 | 534124214401 |
11 | 196580215888 |
12 | 87625151141 |
13 | 3b4a1aa580b |
14 | 1bbcd2b78c1 |
15 | dd6186b751 |
hex | 7c5c48b881 |
534124214401 has 4 divisors (see below), whose sum is σ = 534134386432. Its totient is φ = 534114042372.
The previous prime is 534124214381. The next prime is 534124214431. The reversal of 534124214401 is 104412421435.
It is a happy number.
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 534124214401 - 211 = 534124212353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (534124214431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5006841 + ... + 5112406.
It is an arithmetic number, because the mean of its divisors is an integer number (133533596608).
Almost surely, 2534124214401 is an apocalyptic number.
It is an amenable number.
534124214401 is a deficient number, since it is larger than the sum of its proper divisors (10172031).
534124214401 is a wasteful number, since it uses less digits than its factorization.
534124214401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10172030.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 534124214401 its reverse (104412421435), we get a palindrome (638536635836).
The spelling of 534124214401 in words is "five hundred thirty-four billion, one hundred twenty-four million, two hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •