Base | Representation |
---|---|
bin | 100000001101001… |
… | …111110011011001 |
3 | 1101122202021221201 |
4 | 200031033303121 |
5 | 2101311443023 |
6 | 125341234201 |
7 | 16250562343 |
oct | 4015176331 |
9 | 1348667851 |
10 | 540343513 |
11 | 258012096 |
12 | 130b62961 |
13 | 87c3c0b8 |
14 | 51a98293 |
15 | 32686bad |
hex | 2034fcd9 |
540343513 has 8 divisors (see below), whose sum is σ = 547325856. Its totient is φ = 533400000.
The previous prime is 540343501. The next prime is 540343519. The reversal of 540343513 is 315343045.
540343513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 540343513 - 217 = 540212441 is a prime.
It is a super-2 number, since 2×5403435132 = 583942224082362338, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (540343519) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18838 + ... + 37888.
It is an arithmetic number, because the mean of its divisors is an integer number (68415732).
Almost surely, 2540343513 is an apocalyptic number.
It is an amenable number.
540343513 is a deficient number, since it is larger than the sum of its proper divisors (6982343).
540343513 is a wasteful number, since it uses less digits than its factorization.
540343513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19415.
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 540343513 is about 23245.2901250985. The cubic root of 540343513 is about 814.4979220321.
Adding to 540343513 its reverse (315343045), we get a palindrome (855686558).
The spelling of 540343513 in words is "five hundred forty million, three hundred forty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •