Base | Representation |
---|---|
bin | 11001011011111111… |
… | …010111110101000101 |
3 | 2121111111111102121221 |
4 | 121123333113311011 |
5 | 421414131034414 |
6 | 20314131240341 |
7 | 1654562612560 |
oct | 313377276505 |
9 | 77444442557 |
10 | 27313143109 |
11 | 1064661474a |
12 | 53631490b1 |
13 | 2763830a55 |
14 | 14716774d7 |
15 | a9ccdd224 |
hex | 65bfd7d45 |
27313143109 has 64 divisors (see below), whose sum is σ = 35268134400. Its totient is φ = 20609261568.
The previous prime is 27313143107. The next prime is 27313143127. The reversal of 27313143109 is 90134131372.
It is not a de Polignac number, because 27313143109 - 21 = 27313143107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27313143107) 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 63 ways as a sum of consecutive naturals, for example, 52223722 + ... + 52224244.
It is an arithmetic number, because the mean of its divisors is an integer number (551064600).
Almost surely, 227313143109 is an apocalyptic number.
27313143109 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
27313143109 is a deficient number, since it is larger than the sum of its proper divisors (7954991291).
27313143109 is a wasteful number, since it uses less digits than its factorization.
27313143109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 27313143109 in words is "twenty-seven billion, three hundred thirteen million, one hundred forty-three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •