Base | Representation |
---|---|
bin | 1100100101101110101001… |
… | …00100100010111001111100 |
3 | 10122000121212111122002001121 |
4 | 12102313110210202321330 |
5 | 12112041110411311133 |
6 | 134514051012520324 |
7 | 5555101645106446 |
oct | 622672444427174 |
9 | 118017774562047 |
10 | 27684630572668 |
11 | 8903a93248813 |
12 | 31315729200a4 |
13 | 125a859b344a4 |
14 | 6b9d2c48b496 |
15 | 33021a1a302d |
hex | 192dd4922e7c |
27684630572668 has 48 divisors (see below), whose sum is σ = 50850425041920. Its totient is φ = 13162993550784.
The previous prime is 27684630572663. The next prime is 27684630572681. The reversal of 27684630572668 is 86627503648672.
It is a Smith number, since the sum of its digits (70) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 27684630572597 and 27684630572606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27684630572663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 253312171 + ... + 253421437.
It is an arithmetic number, because the mean of its divisors is an integer number (1059383855040).
Almost surely, 227684630572668 is an apocalyptic number.
It is an amenable number.
27684630572668 is a deficient number, since it is larger than the sum of its proper divisors (23165794469252).
27684630572668 is a wasteful number, since it uses less digits than its factorization.
27684630572668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125386 (or 125384 counting only the distinct ones).
The product of its (nonzero) digits is 975421440, while the sum is 70.
The spelling of 27684630572668 in words is "twenty-seven trillion, six hundred eighty-four billion, six hundred thirty million, five hundred seventy-two thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •