Base | Representation |
---|---|
bin | 10011010011111000111… |
… | …001001011010010000100 |
3 | 11200212021200220111020111 |
4 | 103103320321023102010 |
5 | 133220222032241111 |
6 | 2453343245242404 |
7 | 164605635020152 |
oct | 23237071132204 |
9 | 4625250814214 |
10 | 1327025665156 |
11 | 471874435454 |
12 | 19522a263404 |
13 | 981a41c2b99 |
14 | 4832a98c3d2 |
15 | 247bb879a21 |
hex | 134f8e4b484 |
1327025665156 has 27 divisors (see below), whose sum is σ = 2336961717349. Its totient is φ = 659348475488.
The previous prime is 1327025665123. The next prime is 1327025665157. The reversal of 1327025665156 is 6515665207231.
The square root of 1327025665156 is 1151966.
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., 6916583556 + 1320109081600 = 83166^2 + 1148960^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1327025665157) 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 8 ways as a sum of consecutive naturals, for example, 384754920 + ... + 384758368.
Almost surely, 21327025665156 is an apocalyptic number.
1327025665156 is the 1151966-th square number.
It is an amenable number.
1327025665156 is a deficient number, since it is larger than the sum of its proper divisors (1009936052193).
1327025665156 is an frugal number, since it uses more digits than its factorization.
1327025665156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7236 (or 3618 counting only the distinct ones).
The product of its (nonzero) digits is 2268000, while the sum is 49.
Multiplying 1327025665156 by its sum of digits (49), we get a square (65024257592644 = 80637622).
The spelling of 1327025665156 in words is "one trillion, three hundred twenty-seven billion, twenty-five million, six hundred sixty-five thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •