Search a number
-
+
49510055 = 571414573
BaseRepresentation
bin1011110011011…
…1011010100111
310110011101000202
42330313122213
5100133310210
64525101115
71140554120
oct274673247
9113141022
1049510055
1125a46701
12146b779b
13a3463ba
14680b047
15452e9a5
hex2f376a7

49510055 has 8 divisors (see below), whose sum is σ = 67899552. Its totient is φ = 33949728.

The previous prime is 49510051. The next prime is 49510057. The reversal of 49510055 is 55001594.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 49510055 - 22 = 49510051 is a prime.

It is a super-2 number, since 2×495100552 = 4902491092206050, which contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (49510051) 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 7 ways as a sum of consecutive naturals, for example, 707252 + ... + 707321.

It is an arithmetic number, because the mean of its divisors is an integer number (8487444).

Almost surely, 249510055 is an apocalyptic number.

49510055 is a deficient number, since it is larger than the sum of its proper divisors (18389497).

49510055 is a wasteful number, since it uses less digits than its factorization.

49510055 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1414585.

The product of its (nonzero) digits is 4500, while the sum is 29.

The square root of 49510055 is about 7036.3381811849. The cubic root of 49510055 is about 367.1958827300.

The spelling of 49510055 in words is "forty-nine million, five hundred ten thousand, fifty-five".

Divisors: 1 5 7 35 1414573 7072865 9902011 49510055