Base | Representation |
---|---|
bin | 1101111110000100110… |
… | …1010000011011000011 |
3 | 211221111010020222020000 |
4 | 3133201031100123003 |
5 | 12413010344100034 |
6 | 302131042051043 |
7 | 23224314341550 |
oct | 3374115203303 |
9 | 757433228200 |
10 | 240001550019 |
11 | 92869688850 |
12 | 3a620049a83 |
13 | 1982a7c50ba |
14 | b88a973a27 |
15 | 639a165599 |
hex | 37e13506c3 |
240001550019 has 40 divisors (see below), whose sum is σ = 446987025408. Its totient is φ = 124676126640.
The previous prime is 240001550017. The next prime is 240001550057. The reversal of 240001550019 is 910055100042.
240001550019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 240001550019 - 21 = 240001550017 is a prime.
It is a super-2 number, since 2×2400015500192 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 240001549974 and 240001550001.
It is not an unprimeable number, because it can be changed into a prime (240001550011) 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 39 ways as a sum of consecutive naturals, for example, 19233907 + ... + 19246380.
Almost surely, 2240001550019 is an apocalyptic number.
240001550019 is a deficient number, since it is larger than the sum of its proper divisors (206985475389).
240001550019 is a wasteful number, since it uses less digits than its factorization.
240001550019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38480317 (or 38480308 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 240001550019 in words is "two hundred forty billion, one million, five hundred fifty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •