Base | Representation |
---|---|
bin | 1011101110001… |
… | …0100101000011 |
3 | 10102111201100200 |
4 | 2323202211003 |
5 | 100041200223 |
6 | 4513420243 |
7 | 1134606042 |
oct | 273424503 |
9 | 112451320 |
10 | 49162563 |
11 | 2582961a |
12 | 1456a683 |
13 | a254198 |
14 | 675a559 |
15 | 44b1a43 |
hex | 2ee2943 |
49162563 has 12 divisors (see below), whose sum is σ = 71073600. Its totient is φ = 32746896.
The previous prime is 49162543. The next prime is 49162573. The reversal of 49162563 is 36526194.
It is a happy number.
49162563 is a `hidden beast` number, since 4 + 91 + 6 + 2 + 563 = 666.
49162563 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 49162563 - 29 = 49162051 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (49162513) 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 11 ways as a sum of consecutive naturals, for example, 18013 + ... + 20561.
It is an arithmetic number, because the mean of its divisors is an integer number (5922800).
Almost surely, 249162563 is an apocalyptic number.
49162563 is a deficient number, since it is larger than the sum of its proper divisors (21911037).
49162563 is a wasteful number, since it uses less digits than its factorization.
49162563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4698 (or 4695 counting only the distinct ones).
The product of its digits is 38880, while the sum is 36.
The square root of 49162563 is about 7011.6020280675. The cubic root of 49162563 is about 366.3347962248.
The spelling of 49162563 in words is "forty-nine million, one hundred sixty-two thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •