Base | Representation |
---|---|
bin | 1001011000110110… |
… | …01110000111111101 |
3 | 111000021012210111211 |
4 | 10230123032013331 |
5 | 40310304104131 |
6 | 2152051044421 |
7 | 235621563523 |
oct | 45433160775 |
9 | 14007183454 |
10 | 5040300541 |
11 | 2157133441 |
12 | b87ba0711 |
13 | 6242cc173 |
14 | 35b592313 |
15 | 1e77675b1 |
hex | 12c6ce1fd |
5040300541 has 4 divisors (see below), whose sum is σ = 5040559584. Its totient is φ = 5040041500.
The previous prime is 5040300521. The next prime is 5040300581. The reversal of 5040300541 is 1450030405.
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 5040300541 - 227 = 4906082813 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 (5040300511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 97735 + ... + 140116.
It is an arithmetic number, because the mean of its divisors is an integer number (1260139896).
Almost surely, 25040300541 is an apocalyptic number.
It is an amenable number.
5040300541 is a deficient number, since it is larger than the sum of its proper divisors (259043).
5040300541 is a wasteful number, since it uses less digits than its factorization.
5040300541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259042.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 5040300541 is about 70995.0740615150. The cubic root of 5040300541 is about 1714.5578554606.
Adding to 5040300541 its reverse (1450030405), we get a palindrome (6490330946).
The spelling of 5040300541 in words is "five billion, forty million, three hundred thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •