Search a number
-
+
48910216451 = 121614021891
BaseRepresentation
bin101101100011010001…
…101010110100000011
311200020122012102122012
4231203101222310003
51300132003411301
634245151403135
73351016660145
oct554321526403
9150218172565
1048910216451
11198195a6598
12958bb234ab
1347c60582a5
14251dad0c95
151413d7aebb
hexb6346ad03

48910216451 has 4 divisors (see below), whose sum is σ = 48914250504. Its totient is φ = 48906182400.

The previous prime is 48910216429. The next prime is 48910216457. The reversal of 48910216451 is 15461201984.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-48910216451 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (48910216457) 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, 1998785 + ... + 2023106.

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

Almost surely, 248910216451 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4034052.

The product of its (nonzero) digits is 69120, while the sum is 41.

The spelling of 48910216451 in words is "forty-eight billion, nine hundred ten million, two hundred sixteen thousand, four hundred fifty-one".

Divisors: 1 12161 4021891 48910216451