Base | Representation |
---|---|
bin | 10011010100100100101… |
… | …100100011011010000001 |
3 | 11200221011220201200200001 |
4 | 103110210230203122001 |
5 | 133223223200203401 |
6 | 2453544220400001 |
7 | 164633100330106 |
oct | 23244454433201 |
9 | 4627156650601 |
10 | 1327760553601 |
11 | 472111243a79 |
12 | 1953b43a6001 |
13 | 98290529311 |
14 | 4839a408aad |
15 | 2481113e601 |
hex | 13524b23681 |
1327760553601 has 8 divisors (see below), whose sum is σ = 1362687191784. Its totient is φ = 1293199639680.
The previous prime is 1327760553577. The next prime is 1327760553607. The reversal of 1327760553601 is 1063550677231.
It can be written as a sum of positive squares in 4 ways, for example, as 79287296400 + 1248473257201 = 281580^2 + 1117351^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1327760553601 - 29 = 1327760553089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1327760553607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91423710 + ... + 91438231.
It is an arithmetic number, because the mean of its divisors is an integer number (170335898973).
Almost surely, 21327760553601 is an apocalyptic number.
It is an amenable number.
1327760553601 is a deficient number, since it is larger than the sum of its proper divisors (34926638183).
1327760553601 is a wasteful number, since it uses less digits than its factorization.
1327760553601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182862131.
The product of its (nonzero) digits is 793800, while the sum is 46.
The spelling of 1327760553601 in words is "one trillion, three hundred twenty-seven billion, seven hundred sixty million, five hundred fifty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •