Base | Representation |
---|---|
bin | 11001101101010111… |
… | …101000011000101101 |
3 | 2122020211010211010211 |
4 | 121231113220120231 |
5 | 423013301340203 |
6 | 20403104502421 |
7 | 1665033130546 |
oct | 315527503055 |
9 | 78224124124 |
10 | 27604715053 |
11 | 10786161aa3 |
12 | 542491aa11 |
13 | 27ac06a626 |
14 | 149c2954cd |
15 | ab86d4c6d |
hex | 66d5e862d |
27604715053 has 4 divisors (see below), whose sum is σ = 28278000828. Its totient is φ = 26931429280.
The previous prime is 27604715051. The next prime is 27604715057. The reversal of 27604715053 is 35051740672.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5701307049 + 21903408004 = 75507^2 + 147998^2 .
It is a cyclic number.
It is not a de Polignac number, because 27604715053 - 21 = 27604715051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27604714997 and 27604715015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27604715051) 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 3 ways as a sum of consecutive naturals, for example, 336642826 + ... + 336642907.
It is an arithmetic number, because the mean of its divisors is an integer number (7069500207).
Almost surely, 227604715053 is an apocalyptic number.
It is an amenable number.
27604715053 is a deficient number, since it is larger than the sum of its proper divisors (673285775).
27604715053 is an equidigital number, since it uses as much as digits as its factorization.
27604715053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673285774.
The product of its (nonzero) digits is 176400, while the sum is 40.
The spelling of 27604715053 in words is "twenty-seven billion, six hundred four million, seven hundred fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •