Base | Representation |
---|---|
bin | 11001110011001010… |
… | …110010111000011101 |
3 | 2122111121020002110212 |
4 | 121303022302320131 |
5 | 423213203412334 |
6 | 20420502142205 |
7 | 2000324141444 |
oct | 316312627035 |
9 | 78447202425 |
10 | 27702013469 |
11 | 10826078809 |
12 | 5451421965 |
13 | 27c6276560 |
14 | 14ab181d5b |
15 | ac2003ece |
hex | 6732b2e1d |
27702013469 has 4 divisors (see below), whose sum is σ = 29832937596. Its totient is φ = 25571089344.
The previous prime is 27702013459. The next prime is 27702013477. The reversal of 27702013469 is 96431020772.
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 14318994244 + 13383019225 = 119662^2 + 115685^2 .
It is a cyclic number.
It is not a de Polignac number, because 27702013469 - 212 = 27702009373 is a prime.
It is a super-2 number, since 2×277020134692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27702013459) 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, 1065462044 + ... + 1065462069.
It is an arithmetic number, because the mean of its divisors is an integer number (7458234399).
Almost surely, 227702013469 is an apocalyptic number.
It is an amenable number.
27702013469 is a deficient number, since it is larger than the sum of its proper divisors (2130924127).
27702013469 is a wasteful number, since it uses less digits than its factorization.
27702013469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2130924126.
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 27702013469 in words is "twenty-seven billion, seven hundred two million, thirteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •