Base | Representation |
---|---|
bin | 1011110001101… |
… | …0010000110101 |
3 | 10102221022020011 |
4 | 2330122100311 |
5 | 100121000040 |
6 | 4522340221 |
7 | 1136546023 |
oct | 274322065 |
9 | 112838204 |
10 | 49390645 |
11 | 25974a17 |
12 | 1465a671 |
13 | a303c45 |
14 | 67b9713 |
15 | 45093ea |
hex | 2f1a435 |
49390645 has 4 divisors (see below), whose sum is σ = 59268780. Its totient is φ = 39512512.
The previous prime is 49390631. The next prime is 49390667. The reversal of 49390645 is 54609394.
49390645 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.
It can be written as a sum of positive squares in 2 ways, for example, as 26894596 + 22496049 = 5186^2 + 4743^2 .
It is a cyclic number.
It is not a de Polignac number, because 49390645 - 211 = 49388597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49390598 and 49390607.
It is a congruent number.
It is an unprimeable number.
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, 4939060 + ... + 4939069.
It is an arithmetic number, because the mean of its divisors is an integer number (14817195).
Almost surely, 249390645 is an apocalyptic number.
It is an amenable number.
49390645 is a deficient number, since it is larger than the sum of its proper divisors (9878135).
49390645 is an equidigital number, since it uses as much as digits as its factorization.
49390645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9878134.
The product of its (nonzero) digits is 116640, while the sum is 40.
The square root of 49390645 is about 7027.8478213462. The cubic root of 49390645 is about 366.9004399955.
The spelling of 49390645 in words is "forty-nine million, three hundred ninety thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •