Base | Representation |
---|---|
bin | 1000011101101100110001… |
… | …10100101011001110011100 |
3 | 2102220100112002022001212022 |
4 | 10032312120310223032130 |
5 | 4414422210223121230 |
6 | 103330311531555312 |
7 | 3630501666102032 |
oct | 416663064531634 |
9 | 72810462261768 |
10 | 18612657238940 |
11 | 5a266468647a6 |
12 | 21073112bbb38 |
13 | a50220a5b57b |
14 | 484c00a76552 |
15 | 22425801e1e5 |
hex | 10ed98d2b39c |
18612657238940 has 48 divisors (see below), whose sum is σ = 40451551308000. Its totient is φ = 7185286278912.
The previous prime is 18612657238909. The next prime is 18612657238979. The reversal of 18612657238940 is 4983275621681.
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 15 ways as a sum of consecutive naturals, for example, 5440490 + ... + 8174609.
It is an arithmetic number, because the mean of its divisors is an integer number (842740652250).
It is a 1-persistent number, because it is pandigital, but 2⋅18612657238940 = 37225314477880 is not.
Almost surely, 218612657238940 is an apocalyptic number.
18612657238940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
18612657238940 is an abundant number, since it is smaller than the sum of its proper divisors (21838894069060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18612657238940 is a wasteful number, since it uses less digits than its factorization.
18612657238940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13617494 (or 13617492 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 62.
The spelling of 18612657238940 in words is "eighteen trillion, six hundred twelve billion, six hundred fifty-seven million, two hundred thirty-eight thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •