Search a number
-
+
31010100111 = 323823901273
BaseRepresentation
bin11100111000010110…
…001001001110001111
32222001010222022020100
4130320112021032033
51002002041200421
622125034022143
72145313334064
oct347026111617
988033868210
1031010100111
1112173436211
126015277953
132c0272a583
141702664c6b
15c17652c26
hex73858938f

31010100111 has 12 divisors (see below), whose sum is σ = 44804133088. Its totient is φ = 20667969504.

The previous prime is 31010100101. The next prime is 31010100133. The reversal of 31010100111 is 11100101013.

It is not a de Polignac number, because 31010100111 - 29 = 31010099599 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 31010100093 and 31010100102.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 416230 + ... + 485043.

Almost surely, 231010100111 is an apocalyptic number.

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

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

31010100111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 31010100111 its reverse (11100101013), we get a palindrome (42110201124).

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

Divisors: 1 3 9 3823 11469 34407 901273 2703819 8111457 3445566679 10336700037 31010100111