Base | Representation |
---|---|
bin | 1000011110010101010001… |
… | …10001010100010011100100 |
3 | 2102222102122100110000002011 |
4 | 10033022220301110103210 |
5 | 4420301222301134224 |
6 | 103344305222524004 |
7 | 3632201536266634 |
oct | 417125061242344 |
9 | 72872570400064 |
10 | 18634399630564 |
11 | 5a348938803a3 |
12 | 210b57a896604 |
13 | a522a7405a63 |
14 | 485ca451a6c4 |
15 | 224acbc14394 |
hex | 10f2a8c544e4 |
18634399630564 has 27 divisors (see below), whose sum is σ = 32667394998441. Its totient is φ = 9300886786800.
The previous prime is 18634399630547. The next prime is 18634399630571. The reversal of 18634399630564 is 46503699343681.
The square root of 18634399630564 is 4316758.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 16070942464164 + 2563457166400 = 4008858^2 + 1601080^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 18634399630564.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 6052093177 + ... + 6052096255.
Almost surely, 218634399630564 is an apocalyptic number.
18634399630564 is the 4316758-th square number.
It is an amenable number.
18634399630564 is a deficient number, since it is larger than the sum of its proper divisors (14032995367877).
18634399630564 is an frugal number, since it uses more digits than its factorization.
18634399630564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7564 (or 3782 counting only the distinct ones).
The product of its (nonzero) digits is 302330880, while the sum is 67.
The spelling of 18634399630564 in words is "eighteen trillion, six hundred thirty-four billion, three hundred ninety-nine million, six hundred thirty thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •