Base | Representation |
---|---|
bin | 1011110001101… |
… | …1111101001101 |
3 | 10102221122202001 |
4 | 2330123331031 |
5 | 100121210311 |
6 | 4522432301 |
7 | 1136605162 |
oct | 274337515 |
9 | 112848661 |
10 | 49397581 |
11 | 2597a152 |
12 | 14662691 |
13 | a30714c |
14 | 67bc069 |
15 | 450b4c1 |
hex | 2f1bf4d |
49397581 has 4 divisors (see below), whose sum is σ = 49952700. Its totient is φ = 48842464.
The previous prime is 49397561. The next prime is 49397599. The reversal of 49397581 is 18579394.
It is a happy number.
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 35402500 + 13995081 = 5950^2 + 3741^2 .
It is a cyclic number.
It is not a de Polignac number, because 49397581 - 29 = 49397069 is a prime.
It is a super-2 number, since 2×493975812 = 4880242017303122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49397501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 277426 + ... + 277603.
It is an arithmetic number, because the mean of its divisors is an integer number (12488175).
Almost surely, 249397581 is an apocalyptic number.
It is an amenable number.
49397581 is a deficient number, since it is larger than the sum of its proper divisors (555119).
49397581 is an equidigital number, since it uses as much as digits as its factorization.
49397581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555118.
The product of its digits is 272160, while the sum is 46.
The square root of 49397581 is about 7028.3412694604. The cubic root of 49397581 is about 366.9176139788.
The spelling of 49397581 in words is "forty-nine million, three hundred ninety-seven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •