Base | Representation |
---|---|
bin | 100000001101001… |
… | …010001011110101 |
3 | 1101122201010101102 |
4 | 200031022023311 |
5 | 2101310224001 |
6 | 125340535445 |
7 | 16250435300 |
oct | 4015121365 |
9 | 1348633342 |
10 | 540320501 |
11 | 257aa6876 |
12 | 130b51585 |
13 | 87c31796 |
14 | 51a8db37 |
15 | 3267ee6b |
hex | 2034a2f5 |
540320501 has 6 divisors (see below), whose sum is σ = 628536150. Its totient is φ = 463131816.
The previous prime is 540320479. The next prime is 540320519. The reversal of 540320501 is 105023045.
It can be written as a sum of positive squares in only one way, i.e., 417221476 + 123099025 = 20426^2 + 11095^2 .
It is a de Polignac number, because none of the positive numbers 2k-540320501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540320551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5513426 + ... + 5513523.
It is an arithmetic number, because the mean of its divisors is an integer number (104756025).
Almost surely, 2540320501 is an apocalyptic number.
It is an amenable number.
540320501 is a deficient number, since it is larger than the sum of its proper divisors (88215649).
540320501 is a wasteful number, since it uses less digits than its factorization.
540320501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11026963 (or 11026956 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 540320501 is about 23244.7951378368. The cubic root of 540320501 is about 814.4863593306.
Adding to 540320501 its reverse (105023045), we get a palindrome (645343546).
The spelling of 540320501 in words is "five hundred forty million, three hundred twenty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •