Base | Representation |
---|---|
bin | 1111101111000001111… |
… | …10011001110101100001 |
3 | 1220200111111122022000120 |
4 | 13313200332121311201 |
5 | 32324220203222022 |
6 | 1052211414310453 |
7 | 54026460540111 |
oct | 7674076316541 |
9 | 1820444568016 |
10 | 540645367137 |
11 | 199317240407 |
12 | 88945058429 |
13 | 3bca0b21685 |
14 | 1c24b3c7041 |
15 | e0e40e9d5c |
hex | 7de0f99d61 |
540645367137 has 8 divisors (see below), whose sum is σ = 758800515360. Its totient is φ = 341460231840.
The previous prime is 540645367043. The next prime is 540645367181. The reversal of 540645367137 is 731763546045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 540645367137 - 214 = 540645350753 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 540645367137.
It is not an unprimeable number, because it can be changed into a prime (540645369137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4742503164 + ... + 4742503277.
It is an arithmetic number, because the mean of its divisors is an integer number (94850064420).
Almost surely, 2540645367137 is an apocalyptic number.
540645367137 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
540645367137 is a deficient number, since it is larger than the sum of its proper divisors (218155148223).
540645367137 is a wasteful number, since it uses less digits than its factorization.
540645367137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9485006463.
The product of its (nonzero) digits is 6350400, while the sum is 51.
The spelling of 540645367137 in words is "five hundred forty billion, six hundred forty-five million, three hundred sixty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •