Base | Representation |
---|---|
bin | 11001110011000000… |
… | …101000010111100001 |
3 | 2122111102012201110101 |
4 | 121303000220113201 |
5 | 423212013131321 |
6 | 20420325102401 |
7 | 2000262403264 |
oct | 316300502741 |
9 | 78442181411 |
10 | 27699348961 |
11 | 10824618939 |
12 | 5450557a01 |
13 | 27c585281b |
14 | 14aaa8acdb |
15 | ac1b79791 |
hex | 6730285e1 |
27699348961 has 8 divisors (see below), whose sum is σ = 28514001024. Its totient is φ = 26888171760.
The previous prime is 27699348959. The next prime is 27699349021. The reversal of 27699348961 is 16984399672.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 27699348961 - 21 = 27699348959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27699348893 and 27699348902.
It is not an unprimeable number, because it can be changed into a prime (27699348931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 852535 + ... + 884428.
It is an arithmetic number, because the mean of its divisors is an integer number (3564250128).
Almost surely, 227699348961 is an apocalyptic number.
It is an amenable number.
27699348961 is a deficient number, since it is larger than the sum of its proper divisors (814652063).
27699348961 is a wasteful number, since it uses less digits than its factorization.
27699348961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1737431.
The product of its digits is 35271936, while the sum is 64.
The spelling of 27699348961 in words is "twenty-seven billion, six hundred ninety-nine million, three hundred forty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •