Search a number
-
+
31465256413 = 191656066127
BaseRepresentation
bin11101010011011110…
…011011010111011101
310000012212102122022011
4131103132123113131
51003420101201123
622242133351221
72162511160303
oct352336332735
9100185378264
1031465256413
1112387353948
126121798511
132c75b11226
141746ca6273
15c425ade0d
hex75379b5dd

31465256413 has 4 divisors (see below), whose sum is σ = 33121322560. Its totient is φ = 29809190268.

The previous prime is 31465256411. The next prime is 31465256441.

31465256413 is nontrivially palindromic in base 10.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 31465256413 - 21 = 31465256411 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 828033045 + ... + 828033082.

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

Almost surely, 231465256413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1656066146.

The product of its digits is 259200, while the sum is 40.

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

Divisors: 1 19 1656066127 31465256413