Search a number
-
+
48911027 = 114446457
BaseRepresentation
bin1011101010010…
…1001010110011
310102000221022112
42322211022303
5100010123102
64504155535
71132510514
oct272451263
9112027275
1048911027
1125677640
1214468bab
13a196849
1466d2a0b
154462252
hex2ea52b3

48911027 has 4 divisors (see below), whose sum is σ = 53357496. Its totient is φ = 44464560.

The previous prime is 48911021. The next prime is 48911029. The reversal of 48911027 is 72011984.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 48911027 - 24 = 48911011 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 48910984 and 48911002.

It is not an unprimeable number, because it can be changed into a prime (48911021) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2223218 + ... + 2223239.

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

Almost surely, 248911027 is an apocalyptic number.

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

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

48911027 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 4446468.

The product of its (nonzero) digits is 4032, while the sum is 32.

The square root of 48911027 is about 6993.6418981815. The cubic root of 48911027 is about 365.7089542229.

Subtracting from 48911027 its sum of digits (32), we obtain a triangular number (48910995 = T9890).

The spelling of 48911027 in words is "forty-eight million, nine hundred eleven thousand, twenty-seven".

Divisors: 1 11 4446457 48911027