Search a number
-
+
100690933361 = 673149615057
BaseRepresentation
bin101110111000110100…
…1011011011001110001
3100121220022202101122012
41131301221123121301
53122203334331421
6114131244052305
710163133545324
oct1356151333161
9317808671565
10100690933361
1139780452607
1217621234095
1396589c6055
144c32b187bb
152944c1a95b
hex1771a5b671

100690933361 has 4 divisors (see below), whose sum is σ = 100840549092. Its totient is φ = 100541317632.

The previous prime is 100690933339. The next prime is 100690933363. The reversal of 100690933361 is 163339096001.

It is a happy number.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 26347457761 + 74343475600 = 162319^2 + 272660^2 .

It is a cyclic number.

It is not a de Polignac number, because 100690933361 - 210 = 100690932337 is a prime.

It is a super-2 number, since 2×1006909333612 (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 (100690933363) 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, 74806856 + ... + 74808201.

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

Almost surely, 2100690933361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 149615730.

The product of its (nonzero) digits is 78732, while the sum is 41.

The spelling of 100690933361 in words is "one hundred billion, six hundred ninety million, nine hundred thirty-three thousand, three hundred sixty-one".

Divisors: 1 673 149615057 100690933361