Base | Representation |
---|---|
bin | 1011110110010… |
… | …1110010011111 |
3 | 10110112000120201 |
4 | 2331211302133 |
5 | 100210344444 |
6 | 4533124331 |
7 | 1142304646 |
oct | 275456237 |
9 | 113460521 |
10 | 49699999 |
11 | 26066388 |
12 | 147896a7 |
13 | a3b19ab |
14 | 685a35d |
15 | 456add4 |
hex | 2f65c9f |
49699999 has 4 divisors (see below), whose sum is σ = 50139936. Its totient is φ = 49260064.
The previous prime is 49699963. The next prime is 49700011. The reversal of 49699999 is 99999694.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 99999694 = 2 ⋅49999847.
It is a cyclic number.
It is not a de Polignac number, because 49699999 - 211 = 49697951 is a prime.
It is a Duffinian number.
49699999 is a modest number, since divided by 9999 gives 4969 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 49699999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49699499) 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, 219799 + ... + 220024.
It is an arithmetic number, because the mean of its divisors is an integer number (12534984).
Almost surely, 249699999 is an apocalyptic number.
49699999 is a deficient number, since it is larger than the sum of its proper divisors (439937).
49699999 is a wasteful number, since it uses less digits than its factorization.
49699999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439936.
The product of its digits is 12754584, while the sum is 64.
The square root of 49699999 is about 7049.8226218821. The cubic root of 49699999 is about 367.6648625540.
The spelling of 49699999 in words is "forty-nine million, six hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •