Base | Representation |
---|---|
bin | 100000001101011… |
… | …110111111100101 |
3 | 1101122212110022011 |
4 | 200031132333211 |
5 | 2101320440413 |
6 | 125342434221 |
7 | 16251241630 |
oct | 4015367745 |
9 | 1348773264 |
10 | 540405733 |
11 | 25805490a |
12 | 130b92971 |
13 | 87c6150a |
14 | 51ab2c17 |
15 | 3269a33d |
hex | 2035efe5 |
540405733 has 16 divisors (see below), whose sum is σ = 671088640. Its totient is φ = 424666800.
The previous prime is 540405709. The next prime is 540405737. The reversal of 540405733 is 337504045.
It is a cyclic number.
It is not a de Polignac number, because 540405733 - 213 = 540397541 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 540405695 and 540405704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540405737) 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 15 ways as a sum of consecutive naturals, for example, 61413 + ... + 69658.
It is an arithmetic number, because the mean of its divisors is an integer number (41943040).
Almost surely, 2540405733 is an apocalyptic number.
It is an amenable number.
540405733 is a deficient number, since it is larger than the sum of its proper divisors (130682907).
540405733 is a wasteful number, since it uses less digits than its factorization.
540405733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131128.
The product of its (nonzero) digits is 25200, while the sum is 31.
The square root of 540405733 is about 23246.6284222035. The cubic root of 540405733 is about 814.5291836984.
Adding to 540405733 its reverse (337504045), we get a palindrome (877909778).
The spelling of 540405733 in words is "five hundred forty million, four hundred five thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •