Base | Representation |
---|---|
bin | 101101111111010100… |
… | …010000101100010101 |
3 | 11201110102102100001002 |
4 | 231333110100230111 |
5 | 1302112422023231 |
6 | 34403554513045 |
7 | 3365461444526 |
oct | 557724205425 |
9 | 151412370032 |
10 | 49380657941 |
11 | 19a4010420a |
12 | 96a1595785 |
13 | 486c661334 |
14 | 256639084d |
15 | 14403060cb |
hex | b7f510b15 |
49380657941 has 4 divisors (see below), whose sum is σ = 49382421312. Its totient is φ = 49378894572.
The previous prime is 49380657923. The next prime is 49380657971. The reversal of 49380657941 is 14975608394.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14975608394 = 2 ⋅7487804197.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49380657941 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 (49380657971) 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, 838991 + ... + 895916.
It is an arithmetic number, because the mean of its divisors is an integer number (12345605328).
Almost surely, 249380657941 is an apocalyptic number.
It is an amenable number.
49380657941 is a deficient number, since it is larger than the sum of its proper divisors (1763371).
49380657941 is a wasteful number, since it uses less digits than its factorization.
49380657941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1763370.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 49380657941 in words is "forty-nine billion, three hundred eighty million, six hundred fifty-seven thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •