Search a number
-
+
27640505213 = 131241875503
BaseRepresentation
bin11001101111100000…
…001010001101111101
32122100022111011000022
4121233200022031331
5423101432131323
620410423541525
71665646263206
oct315740121575
978308434008
1027640505213
11107a4387742
1254348ba8a5
1327b65bbc39
1414a2d305ad
15abb9044c8
hex66f80a37d

27640505213 has 8 divisors (see below), whose sum is σ = 27967099776. Its totient is φ = 27315662400.

The previous prime is 27640505209. The next prime is 27640505237. The reversal of 27640505213 is 31250504672.

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 27640505213 - 22 = 27640505209 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 227640505213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 875875.

The product of its (nonzero) digits is 50400, while the sum is 35.

The spelling of 27640505213 in words is "twenty-seven billion, six hundred forty million, five hundred five thousand, two hundred thirteen".

Divisors: 1 131 241 31571 875503 114690893 210996223 27640505213