Search a number
-
+
107096010035 = 5710145766293
BaseRepresentation
bin110001110111101101…
…0110110110100110011
3101020102201001000001012
41203233122312310303
53223313034310120
6121111011101135
710510640031260
oct1435732666463
9336381030035
10107096010035
11414679a6503
121890a2a17ab
13a139990051
14527d650267
152bbc1bb1c5
hex18ef6b6d33

107096010035 has 32 divisors (see below), whose sum is σ = 148655544192. Its totient is φ = 72549964800.

The previous prime is 107096010019. The next prime is 107096010041. The reversal of 107096010035 is 530010690701.

It is not a de Polignac number, because 107096010035 - 24 = 107096010019 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 107096009983 and 107096010010.

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 1582349 + ... + 1648641.

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

Almost surely, 2107096010035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 66863.

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

The spelling of 107096010035 in words is "one hundred seven billion, ninety-six million, ten thousand, thirty-five".

Divisors: 1 5 7 35 101 457 505 707 2285 3199 3535 15995 46157 66293 230785 323099 331465 464051 1615495 2320255 6695593 30295901 33477965 46869151 151479505 212071307 234345755 1060356535 3059886001 15299430005 21419202007 107096010035