Base | Representation |
---|---|
bin | 100000010010100… |
… | …010011010010101 |
3 | 1101202100202110212 |
4 | 200102202122111 |
5 | 2102140333303 |
6 | 125431055205 |
7 | 16265430035 |
oct | 4022423225 |
9 | 1352322425 |
10 | 541730453 |
11 | 25887a120 |
12 | 131511505 |
13 | 88306484 |
14 | 51d398c5 |
15 | 3285cad8 |
hex | 204a2695 |
541730453 has 4 divisors (see below), whose sum is σ = 590978688. Its totient is φ = 492482220.
The previous prime is 541730401. The next prime is 541730461. The reversal of 541730453 is 354037145.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 541730453 - 224 = 524953237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (541730953) 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 3 ways as a sum of consecutive naturals, for example, 24624101 + ... + 24624122.
It is an arithmetic number, because the mean of its divisors is an integer number (147744672).
Almost surely, 2541730453 is an apocalyptic number.
It is an amenable number.
541730453 is a deficient number, since it is larger than the sum of its proper divisors (49248235).
541730453 is a wasteful number, since it uses less digits than its factorization.
541730453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49248234.
The product of its (nonzero) digits is 25200, while the sum is 32.
The square root of 541730453 is about 23275.1037162029. The cubic root of 541730453 is about 815.1942041622.
Adding to 541730453 its reverse (354037145), we get a palindrome (895767598).
The spelling of 541730453 in words is "five hundred forty-one million, seven hundred thirty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •