Base | Representation |
---|---|
bin | 11010000010000011… |
… | …000100111100100111 |
3 | 2200010222221212102122 |
4 | 122002003010330213 |
5 | 424221110223201 |
6 | 20501340500155 |
7 | 2006445043511 |
oct | 320203047447 |
9 | 80128855378 |
10 | 27951648551 |
11 | 10943a822a2 |
12 | 5500b4a65b |
13 | 2835bbbb18 |
14 | 14d23a4bb1 |
15 | ad8db4e1b |
hex | 6820c4f27 |
27951648551 has 4 divisors (see below), whose sum is σ = 28019990400. Its totient is φ = 27883306704.
The previous prime is 27951648539. The next prime is 27951648559. The reversal of 27951648551 is 15584615972.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-27951648551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27951648493 and 27951648502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27951648559) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34170311 + ... + 34171128.
It is an arithmetic number, because the mean of its divisors is an integer number (7004997600).
Almost surely, 227951648551 is an apocalyptic number.
27951648551 is a deficient number, since it is larger than the sum of its proper divisors (68341849).
27951648551 is an equidigital number, since it uses as much as digits as its factorization.
27951648551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68341848.
The product of its digits is 3024000, while the sum is 53.
The spelling of 27951648551 in words is "twenty-seven billion, nine hundred fifty-one million, six hundred forty-eight thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •