Search a number
-
+
106245132567 = 375059292027
BaseRepresentation
bin110001011110010110…
…1000001000100010111
3101011020101221221120220
41202330231001010113
53220042223220232
6120450333525423
710450565504040
oct1427455010427
9334211857526
10106245132567
1141070675692
1218711343873
13a032605562
1451dc63d8c7
152b6c64442c
hex18bcb41117

106245132567 has 8 divisors (see below), whose sum is σ = 161897344896. Its totient is φ = 60711504312.

The previous prime is 106245132563. The next prime is 106245132589. The reversal of 106245132567 is 765231542601.

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

It is not a de Polignac number, because 106245132567 - 22 = 106245132563 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106245132567 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5059292037.

The product of its (nonzero) digits is 302400, while the sum is 42.

The spelling of 106245132567 in words is "one hundred six billion, two hundred forty-five million, one hundred thirty-two thousand, five hundred sixty-seven".

Divisors: 1 3 7 21 5059292027 15177876081 35415044189 106245132567