Base | Representation |
---|---|
bin | 1000011111000111100111… |
… | …00011111001100000011100 |
3 | 2110002000101201221202212212 |
4 | 10033203303203321200130 |
5 | 4421222044044123100 |
6 | 103404535005215552 |
7 | 3634146326355065 |
oct | 417436343714034 |
9 | 73060351852785 |
10 | 18661424207900 |
11 | 5a452a1510331 |
12 | 21148612615b8 |
13 | a549c3210316 |
14 | 48730971956c |
15 | 22565e501635 |
hex | 10f8f38f981c |
18661424207900 has 36 divisors (see below), whose sum is σ = 40566459882480. Its totient is φ = 7451450908800.
The previous prime is 18661424207893. The next prime is 18661424208023. The reversal of 18661424207900 is 970242416681.
It is a super-2 number, since 2×186614242079002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (50).
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 11 ways as a sum of consecutive naturals, for example, 163927496 + ... + 164041295.
Almost surely, 218661424207900 is an apocalyptic number.
18661424207900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
18661424207900 is an abundant number, since it is smaller than the sum of its proper divisors (21905035674580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18661424207900 is a wasteful number, since it uses less digits than its factorization.
18661424207900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327969374 (or 327969367 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 50.
The spelling of 18661424207900 in words is "eighteen trillion, six hundred sixty-one billion, four hundred twenty-four million, two hundred seven thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •