Search a number
-
+
107054003895 = 357136933593
BaseRepresentation
bin110001110110011101…
…0100111011010110111
3101020022202222212110020
41203230322213122313
53223221311111040
6121102510500223
710506620006346
oct1435472473267
9336282885406
10107054003895
1141446215693
12188b8204673
13a131073347
145277c37b5d
152bb866ecd0
hex18ecea76b7

107054003895 has 8 divisors (see below), whose sum is σ = 171286406256. Its totient is φ = 57095468736.

The previous prime is 107054003891. The next prime is 107054003929. The reversal of 107054003895 is 598300450701.

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

It is not a de Polignac number, because 107054003895 - 22 = 107054003891 is a prime.

It is a super-2 number, since 2×1070540038952 (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 (107054003891) 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, 3568466782 + ... + 3568466811.

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

Almost surely, 2107054003895 is an apocalyptic number.

107054003895 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 7136933601.

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

The spelling of 107054003895 in words is "one hundred seven billion, fifty-four million, three thousand, eight hundred ninety-five".

Divisors: 1 3 5 15 7136933593 21410800779 35684667965 107054003895