Search a number
-
+
103157681 = 1141228731
BaseRepresentation
bin1100010011000…
…00111110110001
321012002221201212
412021200332301
5202402021211
614123005505
72361553154
oct611407661
9235087655
10103157681
1153258990
122a669895
13184aab63
14d9b3c9b
1590ca38b
hex6260fb1

103157681 has 8 divisors (see below), whose sum is σ = 115280928. Its totient is φ = 91492000.

The previous prime is 103157633. The next prime is 103157701. The reversal of 103157681 is 186751301.

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

It is a cyclic number.

It is not a de Polignac number, because 103157681 - 210 = 103156657 is a prime.

It is a super-2 number, since 2×1031576812 = 21283014298595522, which contains 22 as substring.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113915 + ... + 114816.

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

Almost surely, 2103157681 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 228783.

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

The square root of 103157681 is about 10156.6569795381. The cubic root of 103157681 is about 468.9938958082.

The spelling of 103157681 in words is "one hundred three million, one hundred fifty-seven thousand, six hundred eighty-one".

Divisors: 1 11 41 451 228731 2516041 9377971 103157681