Search a number
-
+
31054962751 = 601199925849
BaseRepresentation
bin11100111011000001…
…010010000000111111
32222011021101120012121
4130323001102000333
51002100032302001
622133315343411
72146366554001
oct347301220077
988137346177
1031054962751
111219679817a
1260282b1b67
132c0bb07507
1417085c2371
15c1b5656a1
hex73b05203f

31054962751 has 8 divisors (see below), whose sum is σ = 31123400000. Its totient is φ = 30986582400.

The previous prime is 31054962713. The next prime is 31054962773. The reversal of 31054962751 is 15726945013.

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 31054962751 - 229 = 30518091839 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (31054962251) 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 7 ways as a sum of consecutive naturals, for example, 1188475 + ... + 1214323.

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

Almost surely, 231054962751 is an apocalyptic number.

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

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

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

The sum of its prime factors is 28449.

The product of its (nonzero) digits is 226800, while the sum is 43.

The spelling of 31054962751 in words is "thirty-one billion, fifty-four million, nine hundred sixty-two thousand, seven hundred fifty-one".

Divisors: 1 601 1999 25849 1201399 15535249 51672151 31054962751