Base | Representation |
---|---|
bin | 1100011001010010011110… |
… | …01100101100100111100100 |
3 | 10120111202120112000120220021 |
4 | 12030221033030230213210 |
5 | 12033040211421021324 |
6 | 133545440351244524 |
7 | 5512160415230302 |
oct | 614511714544744 |
9 | 116452515016807 |
10 | 27257191188964 |
11 | 8759789918300 |
12 | 3082762219744 |
13 | 122945a794b39 |
14 | 6a337dd8d272 |
15 | 32404e881ae4 |
hex | 18ca4f32c9e4 |
27257191188964 has 81 divisors (see below), whose sum is σ = 52670148933801. Its totient is φ = 12333299473440.
The previous prime is 27257191188943. The next prime is 27257191188967. The reversal of 27257191188964 is 46988119175272.
The square root of 27257191188964 is 5220842.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1734568020900 + 25522623168064 = 1317030^2 + 5051992^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27257191188893 and 27257191188902.
It is not an unprimeable number, because it can be changed into a prime (27257191188967) 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, 35261566482 + ... + 35261567254.
Almost surely, 227257191188964 is an apocalyptic number.
27257191188964 is the 5220842-nd square number.
It is an amenable number.
27257191188964 is a deficient number, since it is larger than the sum of its proper divisors (25412957744837).
27257191188964 is an frugal number, since it uses more digits than its factorization.
27257191188964 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2186 (or 1093 counting only the distinct ones).
The product of its digits is 121927680, while the sum is 70.
The spelling of 27257191188964 in words is "twenty-seven trillion, two hundred fifty-seven billion, one hundred ninety-one million, one hundred eighty-eight thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •