Search a number
-
+
16056415252641 = 35352138417547
BaseRepresentation
bin1110100110100110110011…
…1011010111000010100001
32002211222102012000120120010
43221221230323113002201
54101032014301041031
654052114302435133
73245015636525631
oct351515473270241
962758365016503
1016056415252641
11513053a902805
121973a10b92aa9
138c61623759ca
143d71c56726c1
151cc9e6a81246
hexe9a6ced70a1

16056415252641 has 4 divisors (see below), whose sum is σ = 21408553670192. Its totient is φ = 10704276835092.

The previous prime is 16056415252547. The next prime is 16056415252663. The reversal of 16056415252641 is 14625251465061.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 16056415252641 - 27 = 16056415252513 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 216056415252641 is an apocalyptic number.

It is an amenable number.

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

16056415252641 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5352138417550.

The product of its (nonzero) digits is 1728000, while the sum is 48.

The spelling of 16056415252641 in words is "sixteen trillion, fifty-six billion, four hundred fifteen million, two hundred fifty-two thousand, six hundred forty-one".

Divisors: 1 3 5352138417547 16056415252641