Base | Representation |
---|---|
bin | 1011110010000… |
… | …1010001110011 |
3 | 10102222202122101 |
4 | 2330201101303 |
5 | 100122410004 |
6 | 4523121231 |
7 | 1140025552 |
oct | 274412163 |
9 | 112882571 |
10 | 49419379 |
11 | 25994569 |
12 | 14673217 |
13 | a314049 |
14 | 67c5d99 |
15 | 4512ba4 |
hex | 2f21473 |
49419379 has 4 divisors (see below), whose sum is σ = 49433440. Its totient is φ = 49405320.
The previous prime is 49419347. The next prime is 49419389. The reversal of 49419379 is 97391494.
49419379 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 97391494 = 2 ⋅48695747.
It is a cyclic number.
It is not a de Polignac number, because 49419379 - 25 = 49419347 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49419329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3457 + ... + 10525.
It is an arithmetic number, because the mean of its divisors is an integer number (12358360).
Almost surely, 249419379 is an apocalyptic number.
49419379 is a deficient number, since it is larger than the sum of its proper divisors (14061).
49419379 is an equidigital number, since it uses as much as digits as its factorization.
49419379 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14060.
The product of its digits is 244944, while the sum is 46.
The square root of 49419379 is about 7029.8918199358. The cubic root of 49419379 is about 366.9715767696.
The spelling of 49419379 in words is "forty-nine million, four hundred nineteen thousand, three hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •