Base | Representation |
---|---|
bin | 11001101010000111… |
… | …010101011010100000 |
3 | 2122010000101200000000 |
4 | 121222013111122200 |
5 | 422410312031032 |
6 | 20353434300000 |
7 | 1663501040316 |
oct | 315207253240 |
9 | 78100350000 |
10 | 27550111392 |
11 | 10758357501 |
12 | 540a587600 |
13 | 27a095c97b |
14 | 1494d200b6 |
15 | ab39eae7c |
hex | 66a1d56a0 |
27550111392 has 108 divisors (see below), whose sum is σ = 81355409226. Its totient is φ = 9183300480.
The previous prime is 27550111261. The next prime is 27550111403. The reversal of 27550111392 is 29311105572.
27550111392 is a `hidden beast` number, since 2 + 7 + 550 + 1 + 1 + 13 + 92 = 666.
It can be written as a sum of positive squares in only one way, i.e., 16048835856 + 11501275536 = 126684^2 + 107244^2 .
It is a tau number, because it is divible by the number of its divisors (108).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 144342 + ... + 275562.
Almost surely, 227550111392 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27550111392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40677704613).
27550111392 is an abundant number, since it is smaller than the sum of its proper divisors (53805297834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27550111392 is an frugal number, since it uses more digits than its factorization.
27550111392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131255 (or 131226 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 36.
The spelling of 27550111392 in words is "twenty-seven billion, five hundred fifty million, one hundred eleven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •