Base | Representation |
---|---|
bin | 1101111110010001100… |
… | …1110010000001010011 |
3 | 211221121212010220011110 |
4 | 3133210121302001103 |
5 | 12413113110240021 |
6 | 302140235144403 |
7 | 23225535143514 |
oct | 3374431620123 |
9 | 757555126143 |
10 | 240055165011 |
11 | 92896978562 |
12 | 3a635ba5103 |
13 | 19838947a4c |
14 | b893b2ca0b |
15 | 639ec06476 |
hex | 37e4672053 |
240055165011 has 8 divisors (see below), whose sum is σ = 336919529920. Its totient is φ = 151613788392.
The previous prime is 240055164991. The next prime is 240055165057. The reversal of 240055165011 is 110561550042.
240055165011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 240055165011 - 215 = 240055132243 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 240055165011.
It is not an unprimeable number, because it can be changed into a prime (240055165081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2105747005 + ... + 2105747118.
It is an arithmetic number, because the mean of its divisors is an integer number (42114941240).
Almost surely, 2240055165011 is an apocalyptic number.
240055165011 is a deficient number, since it is larger than the sum of its proper divisors (96864364909).
240055165011 is a wasteful number, since it uses less digits than its factorization.
240055165011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4211494145.
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 240055165011 in words is "two hundred forty billion, fifty-five million, one hundred sixty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •