Base | Representation |
---|---|
bin | 11001110010101101… |
… | …100001100111001000 |
3 | 2122111001210021012202 |
4 | 121302231201213020 |
5 | 423204222344202 |
6 | 20420025455332 |
7 | 2000202003434 |
oct | 316255414710 |
9 | 78431707182 |
10 | 27694340552 |
11 | 10821807a5a |
12 | 544a941548 |
13 | 27c47bac78 |
14 | 14aa1459c4 |
15 | ac14da802 |
hex | 672b619c8 |
27694340552 has 36 divisors (see below), whose sum is σ = 55177031715. Its totient is φ = 13028865280.
The previous prime is 27694340537. The next prime is 27694340599. The reversal of 27694340552 is 25504349672.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 13040269636 + 14654070916 = 114194^2 + 121054^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=117674.
It is a super-2 number, since 2×276943405522 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27694340497 and 27694340506.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 8000102 + ... + 8003562.
Almost surely, 227694340552 is an apocalyptic number.
It is an amenable number.
27694340552 is a deficient number, since it is larger than the sum of its proper divisors (27482691163).
27694340552 is an frugal number, since it uses more digits than its factorization.
27694340552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6962 (or 3480 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 47.
The spelling of 27694340552 in words is "twenty-seven billion, six hundred ninety-four million, three hundred forty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •