Search a number
-
+
101310032102 = 250655016051
BaseRepresentation
bin101111001011010001…
…1000110100011100110
3100200111110200212110012
41132112203012203212
53124440332011402
6114312521330222
710214362031036
oct1362643064346
9320443625405
10101310032102
1139a68965664
1217774636972
13972704aa76
144c910338c6
15297e25c452
hex17968c68e6

101310032102 has 4 divisors (see below), whose sum is σ = 151965048156. Its totient is φ = 50655016050.

The previous prime is 101310032099. The next prime is 101310032167. The reversal of 101310032102 is 201230013101.

It is a semiprime because it is the product of two primes.

It is a congruent number.

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 25327508024 + ... + 25327508027.

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

Almost surely, 2101310032102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50655016053.

The product of its (nonzero) digits is 36, while the sum is 14.

Adding to 101310032102 its reverse (201230013101), we get a palindrome (302540045203).

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

Divisors: 1 2 50655016051 101310032102