Base | Representation |
---|---|
bin | 11010000010011101… |
… | …001010001111010101 |
3 | 2200011110211020121111 |
4 | 122002131022033111 |
5 | 424224333022343 |
6 | 20502143215021 |
7 | 2006560131625 |
oct | 320235121725 |
9 | 80143736544 |
10 | 27958485973 |
11 | 10947922360 |
12 | 55032a7471 |
13 | 2837444032 |
14 | 14d3264885 |
15 | ad97b5c9d |
hex | 68274a3d5 |
27958485973 has 8 divisors (see below), whose sum is σ = 30532182336. Its totient is φ = 25390125600.
The previous prime is 27958485917. The next prime is 27958485977. The reversal of 27958485973 is 37958485972.
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 27958485973 - 29 = 27958485461 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 27958485899 and 27958485908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27958485977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1323033 + ... + 1343998.
It is an arithmetic number, because the mean of its divisors is an integer number (3816522792).
Almost surely, 227958485973 is an apocalyptic number.
It is an amenable number.
27958485973 is a deficient number, since it is larger than the sum of its proper divisors (2573696363).
27958485973 is a wasteful number, since it uses less digits than its factorization.
27958485973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2667995.
The product of its digits is 152409600, while the sum is 67.
Subtracting 27958485973 from its reverse (37958485972), we obtain a palindrome (9999999999).
The spelling of 27958485973 in words is "twenty-seven billion, nine hundred fifty-eight million, four hundred eighty-five thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •