Search a number
-
+
103015330 = 25118811063
BaseRepresentation
bin1100010001111…
…10001110100010
321011211201110121
412020332032202
5202332442310
614115550454
72360421145
oct610761642
9234751417
10103015330
1153170a40
122a5bb42a
131845b122
14d97805c
15909d0da
hex623e3a2

103015330 has 32 divisors (see below), whose sum is σ = 202704768. Its totient is φ = 37382400.

The previous prime is 103015313. The next prime is 103015331. The reversal of 103015330 is 33510301.

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

It is not an unprimeable number, because it can be changed into a prime (103015331) 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 15 ways as a sum of consecutive naturals, for example, 96379 + ... + 97441.

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

Almost surely, 2103015330 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1962.

The product of its (nonzero) digits is 135, while the sum is 16.

The square root of 103015330 is about 10149.6467918839. The cubic root of 103015330 is about 468.7780693117.

Adding to 103015330 its reverse (33510301), we get a palindrome (136525631).

The spelling of 103015330 in words is "one hundred three million, fifteen thousand, three hundred thirty".

Divisors: 1 2 5 10 11 22 55 110 881 1063 1762 2126 4405 5315 8810 9691 10630 11693 19382 23386 48455 58465 96910 116930 936503 1873006 4682515 9365030 10301533 20603066 51507665 103015330