Base | Representation |
---|---|
bin | 11010000000011001… |
… | …000000111001011001 |
3 | 2200002001122021201021 |
4 | 122000121000321121 |
5 | 424142001012242 |
6 | 20454504522441 |
7 | 2005656522640 |
oct | 320031007131 |
9 | 80061567637 |
10 | 27923844697 |
11 | 1092a311901 |
12 | 54b3780421 |
13 | 2830205638 |
14 | 14cc808357 |
15 | ad6721b67 |
hex | 680640e59 |
27923844697 has 4 divisors (see below), whose sum is σ = 31912965376. Its totient is φ = 23934724020.
The previous prime is 27923844671. The next prime is 27923844701. The reversal of 27923844697 is 79644832972.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27923844697 is a prime.
It is a super-2 number, since 2×279238446972 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27923844617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1994560329 + ... + 1994560342.
It is an arithmetic number, because the mean of its divisors is an integer number (7978241344).
Almost surely, 227923844697 is an apocalyptic number.
It is an amenable number.
27923844697 is a deficient number, since it is larger than the sum of its proper divisors (3989120679).
27923844697 is an equidigital number, since it uses as much as digits as its factorization.
27923844697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3989120678.
The product of its digits is 36578304, while the sum is 61.
The spelling of 27923844697 in words is "twenty-seven billion, nine hundred twenty-three million, eight hundred forty-four thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •