Search a number
-
+
106575035351066 = 259903178265687
BaseRepresentation
bin11000001110110111101111…
…000111111100000000011010
3111222100110210110022120101222
4120032313233013330000122
5102432111133022213231
61014355521221012042
731306535504403422
oct3016675707740032
9458313713276358
10106575035351066
1130a5a245060957
12bb52b57854022
134760ca1026509
141c4638b4a1482
15c4c3dba8727b
hex60edef1fc01a

106575035351066 has 8 divisors (see below), whose sum is σ = 162572087823840. Its totient is φ = 52384339409788.

The previous prime is 106575035351063. The next prime is 106575035351093. The reversal of 106575035351066 is 660153530575601.

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

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

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

It is not an unprimeable number, because it can be changed into a prime (106575035351063) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 451589132726 + ... + 451589132961.

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

Almost surely, 2106575035351066 is an apocalyptic number.

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

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

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

The sum of its prime factors is 903178265748.

The product of its (nonzero) digits is 8505000, while the sum is 53.

The spelling of 106575035351066 in words is "one hundred six trillion, five hundred seventy-five billion, thirty-five million, three hundred fifty-one thousand, sixty-six".

Divisors: 1 2 59 118 903178265687 1806356531374 53287517675533 106575035351066