Base | Representation |
---|---|
bin | 1111101111011011111… |
… | …10101100110000100101 |
3 | 1220201001201012001112001 |
4 | 13313231332230300211 |
5 | 32330142032022303 |
6 | 1052245210525301 |
7 | 54035050210204 |
oct | 7675576546045 |
9 | 1821051161461 |
10 | 540863548453 |
11 | 199419411248 |
12 | 889a6136831 |
13 | 3c0070a3347 |
14 | 1c26c37d23b |
15 | e10834631d |
hex | 7dedfacc25 |
540863548453 has 4 divisors (see below), whose sum is σ = 540865251468. Its totient is φ = 540861845440.
The previous prime is 540863548441. The next prime is 540863548517. The reversal of 540863548453 is 354845368045.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 146320020324 + 394543528129 = 382518^2 + 628127^2 .
It is a cyclic number.
It is not a de Polignac number, because 540863548453 - 237 = 403424594981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 540863548394 and 540863548403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540863546453) 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, 218026 + ... + 1062667.
It is an arithmetic number, because the mean of its divisors is an integer number (135216312867).
Almost surely, 2540863548453 is an apocalyptic number.
It is an amenable number.
540863548453 is a deficient number, since it is larger than the sum of its proper divisors (1703015).
540863548453 is a wasteful number, since it uses less digits than its factorization.
540863548453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1703014.
The product of its (nonzero) digits is 27648000, while the sum is 55.
The spelling of 540863548453 in words is "five hundred forty billion, eight hundred sixty-three million, five hundred forty-eight thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •