Base | Representation |
---|---|
bin | 1011101100101… |
… | …1001100010001 |
3 | 10102022211221202 |
4 | 2323023030101 |
5 | 100030114034 |
6 | 4511400545 |
7 | 1134026543 |
oct | 273131421 |
9 | 112284852 |
10 | 49066769 |
11 | 25773654 |
12 | 14523155 |
13 | a21c6bb |
14 | 6733693 |
15 | 449347e |
hex | 2ecb311 |
49066769 has 4 divisors (see below), whose sum is σ = 50649600. Its totient is φ = 47483940.
The previous prime is 49066763. The next prime is 49066789. The reversal of 49066769 is 96766094.
49066769 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 Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 49066769 - 216 = 49001233 is a prime.
It is a super-2 number, since 2×490667692 = 4815095640198722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49066763) 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, 791369 + ... + 791430.
It is an arithmetic number, because the mean of its divisors is an integer number (12662400).
Almost surely, 249066769 is an apocalyptic number.
It is an amenable number.
49066769 is a deficient number, since it is larger than the sum of its proper divisors (1582831).
49066769 is a wasteful number, since it uses less digits than its factorization.
49066769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582830.
The product of its (nonzero) digits is 489888, while the sum is 47.
The square root of 49066769 is about 7004.7675907199. The cubic root of 49066769 is about 366.0967052134.
The spelling of 49066769 in words is "forty-nine million, sixty-six thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •