Search a number
-
+
102003951 = 3719255649
BaseRepresentation
bin1100001010001…
…11010011101111
321002221100010010
412011013103233
5202103111301
614042144303
72346006420
oct605072357
9232840103
10102003951
1152640095
122a1b2093
131819598a
14d793647
158e4d5d6
hex61474ef

102003951 has 16 divisors (see below), whose sum is σ = 163616000. Its totient is φ = 55219968.

The previous prime is 102003947. The next prime is 102003971. The reversal of 102003951 is 159300201.

It is not a de Polignac number, because 102003951 - 22 = 102003947 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (21).

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 127426 + ... + 128223.

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

Almost surely, 2102003951 is an apocalyptic number.

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

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

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

The sum of its prime factors is 255678.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 102003951 is about 10099.7005401150. The cubic root of 102003951 is about 467.2389055586.

The spelling of 102003951 in words is "one hundred two million, three thousand, nine hundred fifty-one".

Divisors: 1 3 7 19 21 57 133 399 255649 766947 1789543 4857331 5368629 14571993 34001317 102003951