Search a number
-
+
10327092261 = 311330463399
BaseRepresentation
bin10011001111000101…
…01110110000100101
3222122201020122100120
421213202232300211
5132122213423021
64424425232153
7513625556463
oct114742566045
928581218316
1010327092261
11441a4132a2
122002632659
13c876b28a5
146dd789833
1540696e2c6
hex2678aec25

10327092261 has 8 divisors (see below), whose sum is σ = 13891310400. Its totient is φ = 6823801152.

The previous prime is 10327092257. The next prime is 10327092271. The reversal of 10327092261 is 16229072301.

10327092261 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 not a de Polignac number, because 10327092261 - 22 = 10327092257 is a prime.

It is a congruent number.

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

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

Almost surely, 210327092261 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 30463515.

The product of its (nonzero) digits is 9072, while the sum is 33.

The spelling of 10327092261 in words is "ten billion, three hundred twenty-seven million, ninety-two thousand, two hundred sixty-one".

Divisors: 1 3 113 339 30463399 91390197 3442364087 10327092261