Base | Representation |
---|---|
bin | 1011101100000… |
… | …0011110000101 |
3 | 10102020121201020 |
4 | 2323000132011 |
5 | 100022212403 |
6 | 4510421353 |
7 | 1133454525 |
oct | 273003605 |
9 | 112217636 |
10 | 49022853 |
11 | 25743660 |
12 | 14501859 |
13 | a205709 |
14 | 6721685 |
15 | 4485453 |
hex | 2ec0785 |
49022853 has 8 divisors (see below), whose sum is σ = 71306016. Its totient is φ = 29710800.
The previous prime is 49022843. The next prime is 49022861. The reversal of 49022853 is 35822094.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 49022853 - 212 = 49018757 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 1485541 = 49022853 / (4 + 9 + 0 + 2 + 2 + 8 + 5 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49022803) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 742738 + ... + 742803.
It is an arithmetic number, because the mean of its divisors is an integer number (8913252).
Almost surely, 249022853 is an apocalyptic number.
It is an amenable number.
49022853 is a deficient number, since it is larger than the sum of its proper divisors (22283163).
49022853 is a wasteful number, since it uses less digits than its factorization.
49022853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1485555.
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 49022853 is about 7001.6321668594. The cubic root of 49022853 is about 365.9874506731.
The spelling of 49022853 in words is "forty-nine million, twenty-two thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.261 sec. • engine limits •