Search a number
-
+
10270931313 = 323148854077
BaseRepresentation
bin10011001000011000…
…11111100101110001
3222111210120101000110
421210030133211301
5132013324300223
64415101411533
7512344322106
oct114414374561
928453511013
1010270931313
1143a0744795
121ba7869ba9
13c78b7b166
146d612aaad
15401a78d93
hex26431f971

10270931313 has 8 divisors (see below), whose sum is σ = 14289991488. Its totient is φ = 6549579344.

The previous prime is 10270931311. The next prime is 10270931329. The reversal of 10270931313 is 31313907201.

10270931313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 10270931313 - 21 = 10270931311 is a prime.

It is not an unprimeable number, because it can be changed into a prime (10270931311) 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, 74426970 + ... + 74427107.

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

Almost surely, 210270931313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 148854103.

The product of its (nonzero) digits is 3402, while the sum is 30.

The spelling of 10270931313 in words is "ten billion, two hundred seventy million, nine hundred thirty-one thousand, three hundred thirteen".

Divisors: 1 3 23 69 148854077 446562231 3423643771 10270931313