Base | Representation |
---|---|
bin | 1011101100010… |
… | …1100100000001 |
3 | 10102021200022211 |
4 | 2323011210001 |
5 | 100023344323 |
6 | 4511102121 |
7 | 1133602405 |
oct | 273054401 |
9 | 112250284 |
10 | 49043713 |
11 | 257582a4 |
12 | 14511941 |
13 | a212064 |
14 | 6729105 |
15 | 448b70d |
hex | 2ec5901 |
49043713 has 4 divisors (see below), whose sum is σ = 49059540. Its totient is φ = 49027888.
The previous prime is 49043711. The next prime is 49043719. The reversal of 49043713 is 31734094.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46949904 + 2093809 = 6852^2 + 1447^2 .
It is a cyclic number.
It is not a de Polignac number, because 49043713 - 21 = 49043711 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49043711) 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, 1570 + ... + 10027.
It is an arithmetic number, because the mean of its divisors is an integer number (12264885).
Almost surely, 249043713 is an apocalyptic number.
It is an amenable number.
49043713 is a deficient number, since it is larger than the sum of its proper divisors (15827).
49043713 is a wasteful number, since it uses less digits than its factorization.
49043713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15826.
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 49043713 is about 7003.1216610880. The cubic root of 49043713 is about 366.0393544631.
The spelling of 49043713 in words is "forty-nine million, forty-three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •