Base | Representation |
---|---|
bin | 1100101011101000001110… |
… | …10010110111000001100001 |
3 | 10122202000010000122212011011 |
4 | 12111310013102313001201 |
5 | 12123401240312144114 |
6 | 135151134111220521 |
7 | 5605536256453024 |
oct | 625640722670141 |
9 | 118660100585134 |
10 | 27887345037409 |
11 | 8981a58285500 |
12 | 3164907517741 |
13 | 12739c4632c00 |
14 | 6c5a7cc891bb |
15 | 335631ab81c4 |
hex | 195d074b7061 |
27887345037409 has 27 divisors (see below), whose sum is σ = 33193235426169. Its totient is φ = 23401334161920.
The previous prime is 27887345037361. The next prime is 27887345037463. The reversal of 27887345037409 is 90473054378872.
The square root of 27887345037409 is 5280847.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 649676300625 + 27237668736784 = 806025^2 + 5218972^2 .
It is not a de Polignac number, because 27887345037409 - 27 = 27887345037281 is a prime.
It is not an unprimeable number, because it can be changed into a prime (27887345037479) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 755142657 + ... + 755179585.
Almost surely, 227887345037409 is an apocalyptic number.
27887345037409 is the 5280847-th square number.
27887345037409 is the 2640424-th centered octagonal number.
It is an amenable number.
27887345037409 is a deficient number, since it is larger than the sum of its proper divisors (5305890388760).
27887345037409 is an frugal number, since it uses more digits than its factorization.
27887345037409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73906 (or 36953 counting only the distinct ones).
The product of its (nonzero) digits is 284497920, while the sum is 67.
The spelling of 27887345037409 in words is "twenty-seven trillion, eight hundred eighty-seven billion, three hundred forty-five million, thirty-seven thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •