Base | Representation |
---|---|
bin | 11001010001010110… |
… | …011100110111110100 |
3 | 2121001001121201110201 |
4 | 121101112130313310 |
5 | 421032432044300 |
6 | 20244313330244 |
7 | 1650264444253 |
oct | 312126346764 |
9 | 77031551421 |
10 | 27134643700 |
11 | 1056488747a |
12 | 5313406984 |
13 | 2735863bb8 |
14 | 1455a9079a |
15 | a8c2ce66a |
hex | 65159cdf4 |
27134643700 has 18 divisors (see below), whose sum is σ = 58882177046. Its totient is φ = 10853857440.
The previous prime is 27134643673. The next prime is 27134643709. The reversal of 27134643700 is 734643172.
It can be written as a sum of positive squares in 3 ways, for example, as 1696945636 + 25437698064 = 41194^2 + 159492^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 27134643700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27134643709) 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 5 ways as a sum of consecutive naturals, for example, 135673119 + ... + 135673318.
Almost surely, 227134643700 is an apocalyptic number.
27134643700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27134643700 is an abundant number, since it is smaller than the sum of its proper divisors (31747533346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27134643700 is a wasteful number, since it uses less digits than its factorization.
27134643700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271346451 (or 271346444 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 37.
The spelling of 27134643700 in words is "twenty-seven billion, one hundred thirty-four million, six hundred forty-three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •