Base | Representation |
---|---|
bin | 1101111111101000100… |
… | …1101010111000000000 |
3 | 211222120021201110211001 |
4 | 3133322021222320000 |
5 | 12414340012241232 |
6 | 302240351501344 |
7 | 23240555423533 |
oct | 3377211527000 |
9 | 758507643731 |
10 | 240420040192 |
11 | 92a639326a2 |
12 | 3a718227854 |
13 | 1989640b817 |
14 | b8ca38ca1a |
15 | 63c1c7c6e7 |
hex | 37fa26ae00 |
240420040192 has 40 divisors (see below), whose sum is σ = 486451231200. Its totient is φ = 118688354304.
The previous prime is 240420040183. The next prime is 240420040193. The reversal of 240420040192 is 291040024042.
240420040192 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 240420040192.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (240420040193) 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 3 ways as a sum of consecutive naturals, for example, 2931517 + ... + 3012412.
It is an arithmetic number, because the mean of its divisors is an integer number (12161280780).
Almost surely, 2240420040192 is an apocalyptic number.
It is an amenable number.
240420040192 is an abundant number, since it is smaller than the sum of its proper divisors (246031191008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
240420040192 is an frugal number, since it uses more digits than its factorization.
240420040192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5944026 (or 5944010 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
The spelling of 240420040192 in words is "two hundred forty billion, four hundred twenty million, forty thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •