Search a number
-
+
103102113151 = 974212524723
BaseRepresentation
bin110000000000101011…
…1010110010101111111
3100212010100211000111101
41200001113112111333
53142123120110101
6115210420033531
710306652334112
oct1400127262577
9325110730441
10103102113151
113a7a8500684
1217b948328a7
1399513c755b
144dc1048579
152a3674e401
hex18015d657f

103102113151 has 8 divisors (see below), whose sum is σ = 104412485744. Its totient is φ = 101796791040.

The previous prime is 103102113131. The next prime is 103102113193. The reversal of 103102113151 is 151311201301.

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 103102113151 - 233 = 94512178559 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1221525 + ... + 1303198.

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

Almost surely, 2103102113151 is an apocalyptic number.

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

103102113151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 2525241.

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

Adding to 103102113151 its reverse (151311201301), we get a palindrome (254413314452).

The spelling of 103102113151 in words is "one hundred three billion, one hundred two million, one hundred thirteen thousand, one hundred fifty-one".

Divisors: 1 97 421 40837 2524723 244898131 1062908383 103102113151