[go: up one dir, main page]

Search a number
-
+
102305251 = 1394911499
BaseRepresentation
bin1100001100100…
…00110111100011
321010111122102101
412012100313203
5202142232001
614052431231
72351403016
oct606206743
9233448371
10102305251
11528264a4
122a318517
131826cb69
14d83137d
158eaca01
hex6190de3

102305251 has 8 divisors (see below), whose sum is σ = 103320000. Its totient is φ = 101294760.

The previous prime is 102305227. The next prime is 102305257. The reversal of 102305251 is 152503201.

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 102305251 - 29 = 102304739 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (102305257) 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, 67500 + ... + 68998.

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

Almost surely, 2102305251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2129.

The product of its (nonzero) digits is 300, while the sum is 19.

The square root of 102305251 is about 10114.6058252410. The cubic root of 102305251 is about 467.6984978798.

Adding to 102305251 its reverse (152503201), we get a palindrome (254808452).

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

Divisors: 1 139 491 1499 68249 208361 736009 102305251