Search a number
-
+
103032102131 = 753277714561
BaseRepresentation
bin101111111110100110…
…0010001110011110011
3100211221111002002102122
41133331030101303303
53142002204232011
6115155435304455
710305142263260
oct1377514216363
9324844062378
10103032102131
113a771a32332
1217b752ab12b
13993ca53a0a
144db5a22267
152a305203db
hex17fd311cf3

103032102131 has 8 divisors (see below), whose sum is σ = 119972690784. Its totient is φ = 86646942720.

The previous prime is 103032102109. The next prime is 103032102137. The reversal of 103032102131 is 131201230301.

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 103032102131 - 26 = 103032102067 is a prime.

It is a super-2 number, since 2×1030321021312 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2103032102131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 277714621.

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 103032102131 its reverse (131201230301), we get a palindrome (234233332432).

The spelling of 103032102131 in words is "one hundred three billion, thirty-two million, one hundred two thousand, one hundred thirty-one".

Divisors: 1 7 53 371 277714561 1944001927 14718871733 103032102131