Search a number
-
+
106405034561 = 715200719223
BaseRepresentation
bin110001100011000111…
…0111111101001000001
3101011122112211210212222
41203012032333221001
53220404142101221
6120514245100425
710454546604440
oct1430616775101
9334575753788
10106405034561
11411429603a1
12187569b7715
13a059790517
145215984d57
152b7b6cc9ab
hex18c63bfa41

106405034561 has 4 divisors (see below), whose sum is σ = 121605753792. Its totient is φ = 91204315332.

The previous prime is 106405034557. The next prime is 106405034579. The reversal of 106405034561 is 165430504601.

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 a cyclic number.

It is not a de Polignac number, because 106405034561 - 22 = 106405034557 is a prime.

It is a super-2 number, since 2×1064050345612 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2106405034561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15200719230.

The product of its (nonzero) digits is 43200, while the sum is 35.

The spelling of 106405034561 in words is "one hundred six billion, four hundred five million, thirty-four thousand, five hundred sixty-one".

Divisors: 1 7 15200719223 106405034561