Search a number
-
+
103027507 = 1124611847
BaseRepresentation
bin1100010010000…
…01001100110011
321011212100011121
412021001030303
5202333340012
614120123111
72360501512
oct611011463
9234770147
10103027507
115317a100
122a606497
131846382b
14d97c679
1590a1a07
hex6241333

103027507 has 12 divisors (see below), whose sum is σ = 113552208. Its totient is φ = 93407600.

The previous prime is 103027493. The next prime is 103027513. The reversal of 103027507 is 705720301.

It is not a de Polignac number, because 103027507 - 211 = 103025459 is a prime.

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

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54858 + ... + 56704.

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

Almost surely, 2103027507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2330 (or 2319 counting only the distinct ones).

The product of its (nonzero) digits is 1470, while the sum is 25.

The square root of 103027507 is about 10150.2466472495. The cubic root of 103027507 is about 468.7965393318.

Adding to 103027507 its reverse (705720301), we get a palindrome (808747808).

The spelling of 103027507 in words is "one hundred three million, twenty-seven thousand, five hundred seven".

Divisors: 1 11 121 461 1847 5071 20317 55781 223487 851467 9366137 103027507