Base | Representation |
---|---|
bin | 11001100101010110… |
… | …111001110010101001 |
3 | 2121220110020011020021 |
4 | 121211112321302221 |
5 | 422224344301343 |
6 | 20341504000441 |
7 | 1661511516031 |
oct | 314526716251 |
9 | 77813204207 |
10 | 27470306473 |
11 | 107172a9925 |
12 | 53a7900121 |
13 | 278a26a31c |
14 | 14884a88c1 |
15 | aab9d50ed |
hex | 6655b9ca9 |
27470306473 has 8 divisors (see below), whose sum is σ = 29134581696. Its totient is φ = 25845190800.
The previous prime is 27470306447. The next prime is 27470306497. The reversal of 27470306473 is 37460307472.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27470306473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27470303473) 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 7 ways as a sum of consecutive naturals, for example, 9788443 + ... + 9791248.
It is an arithmetic number, because the mean of its divisors is an integer number (3641822712).
Almost surely, 227470306473 is an apocalyptic number.
27470306473 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
27470306473 is a deficient number, since it is larger than the sum of its proper divisors (1664275223).
27470306473 is a wasteful number, since it uses less digits than its factorization.
27470306473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19579775.
The product of its (nonzero) digits is 592704, while the sum is 43.
Subtracting 27470306473 from its reverse (37460307472), we obtain a palindrome (9990000999).
The spelling of 27470306473 in words is "twenty-seven billion, four hundred seventy million, three hundred six thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •