Base | Representation |
---|---|
bin | 1111101110010100010… |
… | …01100001100110000011 |
3 | 1220122111211000212211102 |
4 | 13313022021201212003 |
5 | 32322424134002111 |
6 | 1052105414205015 |
7 | 54014130453641 |
oct | 7671211414603 |
9 | 1818454025742 |
10 | 540262406531 |
11 | 199140053441 |
12 | 8885895376b |
13 | 3bc3c697a73 |
14 | 1c2125ba191 |
15 | e0c06a013b |
hex | 7dca261983 |
540262406531 has 4 divisors (see below), whose sum is σ = 554864093232. Its totient is φ = 525660719832.
The previous prime is 540262406521. The next prime is 540262406533. The reversal of 540262406531 is 135604262045.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-540262406531 is a prime.
It is a super-2 number, since 2×5402624065312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (540262406533) 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, 7300843295 + ... + 7300843368.
It is an arithmetic number, because the mean of its divisors is an integer number (138716023308).
Almost surely, 2540262406531 is an apocalyptic number.
540262406531 is a deficient number, since it is larger than the sum of its proper divisors (14601686701).
540262406531 is a wasteful number, since it uses less digits than its factorization.
540262406531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14601686700.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 540262406531 its reverse (135604262045), we get a palindrome (675866668576).
The spelling of 540262406531 in words is "five hundred forty billion, two hundred sixty-two million, four hundred six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •