Search a number
-
+
105225511145 = 531167669139
BaseRepresentation
bin110000111111111101…
…1011110000011101001
3101001121100100210221112
41201333323132003221
53211000212324040
6120201231520105
710413405041606
oct1417773360351
9331540323845
10105225511145
114069806aa57
1218487989035
139bcc2b8381
1451430656ad
152b0cd89365
hex187fede0e9

105225511145 has 8 divisors (see below), whose sum is σ = 126676630080. Its totient is φ = 83909731120.

The previous prime is 105225511141. The next prime is 105225511151. The reversal of 105225511145 is 541115522501.

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

It is not a de Polignac number, because 105225511145 - 22 = 105225511141 is a prime.

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

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

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

Almost surely, 2105225511145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 67669455.

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

The spelling of 105225511145 in words is "one hundred five billion, two hundred twenty-five million, five hundred eleven thousand, one hundred forty-five".

Divisors: 1 5 311 1555 67669139 338345695 21045102229 105225511145