Search a number
-
+
31165056113 = 281696715919
BaseRepresentation
bin11101000001100101…
…010000010001110001
32222102221112212220112
4131001211100101301
51002311223243423
622152251151105
72152204414622
oct350145202161
988387485815
1031165056113
1112242952a24
126059145495
132c28873209
14171907da49
15c26060a78
hex741950471

31165056113 has 8 divisors (see below), whose sum is σ = 31282417920. Its totient is φ = 31047740640.

The previous prime is 31165056077. The next prime is 31165056157.

31165056113 is nontrivially palindromic in base 10.

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 31165056113 - 214 = 31165039729 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 31165056113.

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

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

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

Almost surely, 231165056113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 23167.

The product of its (nonzero) digits is 8100, while the sum is 32.

It can be divided in two parts, 311650 and 56113, that added together give a palindrome (367763).

The spelling of 31165056113 in words is "thirty-one billion, one hundred sixty-five million, fifty-six thousand, one hundred thirteen".

Divisors: 1 281 6967 15919 1957727 4473239 110907673 31165056113