Search a number
-
+
102615330 = 23597179197
BaseRepresentation
bin1100001110111…
…00100100100010
321011002101202210
412013130210202
5202232142310
614103222550
72354134026
oct607344442
9234071683
10102615330
1152a18464
122a447a56
131834b03c
14d8b2386
15901e820
hex61dc922

102615330 has 64 divisors (see below), whose sum is σ = 251475840. Its totient is φ = 26793984.

The previous prime is 102615277. The next prime is 102615343. The reversal of 102615330 is 33516201.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 102615297 and 102615306.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 520792 + ... + 520988.

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

Almost surely, 2102615330 is an apocalyptic number.

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

102615330 is an abundant number, since it is smaller than the sum of its proper divisors (148860510).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

102615330 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 483.

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

The square root of 102615330 is about 10129.9225071073. The cubic root of 102615330 is about 468.1705401557.

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

Divisors: 1 2 3 5 6 10 15 30 97 179 194 197 291 358 394 485 537 582 591 895 970 985 1074 1182 1455 1790 1970 2685 2910 2955 5370 5910 17363 19109 34726 35263 38218 52089 57327 70526 86815 95545 104178 105789 114654 173630 176315 191090 211578 260445 286635 352630 520890 528945 573270 1057890 3420511 6841022 10261533 17102555 20523066 34205110 51307665 102615330