Search a number
-
+
107096056483 = 1353155436947
BaseRepresentation
bin110001110111101101…
…1000010001010100011
3101020102201010100202111
41203233123002022203
53223313042301413
6121111012100151
710510640313553
oct1435733021243
9336381110674
10107096056483
1141467a28399
121890a304657
13a1399a8230
14527d663163
152bbc1c9d3d
hex18ef6c22a3

107096056483 has 8 divisors (see below), whose sum is σ = 117510332688. Its totient is φ = 96992654304.

The previous prime is 107096056451. The next prime is 107096056489. The reversal of 107096056483 is 384650690701.

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

It is not a de Polignac number, because 107096056483 - 25 = 107096056451 is a prime.

It is a super-2 number, since 2×1070960564832 (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 (107096056489) 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 7 ways as a sum of consecutive naturals, for example, 77717785 + ... + 77719162.

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

Almost surely, 2107096056483 is an apocalyptic number.

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

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

107096056483 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 155437013.

The product of its (nonzero) digits is 1088640, while the sum is 49.

The spelling of 107096056483 in words is "one hundred seven billion, ninety-six million, fifty-six thousand, four hundred eighty-three".

Divisors: 1 13 53 689 155436947 2020680311 8238158191 107096056483