Base | Representation |
---|---|
bin | 1100010110101100011011… |
… | …00001011110101011001010 |
3 | 10120012020110121001112010120 |
4 | 12023112031201132223022 |
5 | 12030110122340323200 |
6 | 133440454301524110 |
7 | 5502553264042320 |
oct | 613261541365312 |
9 | 116166417045116 |
10 | 27168042511050 |
11 | 87249a1801091 |
12 | 3069422573636 |
13 | 1220c2115484c |
14 | 69cd24179d10 |
15 | 321a831189a0 |
hex | 18b58d85eaca |
27168042511050 has 48 divisors (see below), whose sum is σ = 77001994777152. Its totient is φ = 6209838288000.
The previous prime is 27168042511037. The next prime is 27168042511133. The reversal of 27168042511050 is 5011524086172.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 27168042510993 and 27168042511011.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 12937162051 + ... + 12937164150.
It is an arithmetic number, because the mean of its divisors is an integer number (1604208224524).
Almost surely, 227168042511050 is an apocalyptic number.
27168042511050 is an abundant number, since it is smaller than the sum of its proper divisors (49833952266102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27168042511050 is a wasteful number, since it uses less digits than its factorization.
27168042511050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25874326223 (or 25874326218 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 42.
The spelling of 27168042511050 in words is "twenty-seven trillion, one hundred sixty-eight billion, forty-two million, five hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •