Base | Representation |
---|---|
bin | 111100100110011011111… |
… | …110010110100011010000 |
3 | 112202010010222210111110022 |
4 | 330212123332112203100 |
5 | 1021212233132423400 |
6 | 12505041204323012 |
7 | 606604464666101 |
oct | 74463376264320 |
9 | 15663128714408 |
10 | 4164440123600 |
11 | 1366146979369 |
12 | 57311a6a3468 |
13 | 242921c06213 |
14 | 1057ba8143a8 |
15 | 734d7659b85 |
hex | 3c99bf968d0 |
4164440123600 has 30 divisors (see below), whose sum is σ = 10005067397910. Its totient is φ = 1665776049280.
The previous prime is 4164440123539. The next prime is 4164440123651. The reversal of 4164440123600 is 63210444614.
It can be written as a sum of positive squares in 3 ways, for example, as 40665142336 + 4123774981264 = 201656^2 + 2030708^2 .
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 5205549755 + ... + 5205550554.
It is an arithmetic number, because the mean of its divisors is an integer number (333502246597).
Almost surely, 24164440123600 is an apocalyptic number.
4164440123600 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4164440123600 is an abundant number, since it is smaller than the sum of its proper divisors (5840627274310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4164440123600 is a wasteful number, since it uses less digits than its factorization.
4164440123600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10411100327 (or 10411100316 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 35.
The spelling of 4164440123600 in words is "four trillion, one hundred sixty-four billion, four hundred forty million, one hundred twenty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •