Search a number
-
+
31010001102 = 2321722777839
BaseRepresentation
bin11100111000010101…
…110001000011001110
32222001010210021102100
4130320111301003032
51002002030013402
622125031535530
72145312442323
oct347025610316
988033707370
1031010001102
1112173378893
12601522a5a6
132c026c44a2
14170263ab4a
15c1763371c
hex7385710ce

31010001102 has 12 divisors (see below), whose sum is σ = 67188335760. Its totient is φ = 10336667028.

The previous prime is 31010001097. The next prime is 31010001103. The reversal of 31010001102 is 20110001013.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 861388902 + ... + 861388937.

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

Almost surely, 231010001102 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1722777847 (or 1722777844 counting only the distinct ones).

The product of its (nonzero) digits is 6, while the sum is 9.

Adding to 31010001102 its reverse (20110001013), we get a palindrome (51120002115).

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

Divisors: 1 2 3 6 9 18 1722777839 3445555678 5168333517 10336667034 15505000551 31010001102