Base | Representation |
---|---|
bin | 100000001100110… |
… | …100000100101101 |
3 | 1101122112112011001 |
4 | 200030310010231 |
5 | 2101244324213 |
6 | 125335000301 |
7 | 16246610245 |
oct | 4014640455 |
9 | 1348475131 |
10 | 540229933 |
11 | 257a44821 |
12 | 130b09091 |
13 | 87bcc4a9 |
14 | 51a68b25 |
15 | 326631dd |
hex | 2033412d |
540229933 has 8 divisors (see below), whose sum is σ = 559204352. Its totient is φ = 521485776.
The previous prime is 540229931. The next prime is 540230017. The reversal of 540229933 is 339922045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 540229933 - 21 = 540229931 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 540229892 and 540229901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540229931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52785 + ... + 62182.
It is an arithmetic number, because the mean of its divisors is an integer number (69900544).
Almost surely, 2540229933 is an apocalyptic number.
It is an amenable number.
540229933 is a deficient number, since it is larger than the sum of its proper divisors (18974419).
540229933 is a wasteful number, since it uses less digits than its factorization.
540229933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115131.
The product of its (nonzero) digits is 58320, while the sum is 37.
The square root of 540229933 is about 23242.8469211497. The cubic root of 540229933 is about 814.4408489824.
The spelling of 540229933 in words is "five hundred forty million, two hundred twenty-nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •