Base | Representation |
---|---|
bin | 10001010010010001… |
… | …100110011010100000 |
3 | 1202220111022121002211 |
4 | 101102101212122200 |
5 | 301002403332223 |
6 | 12305413451504 |
7 | 1224640136041 |
oct | 212221463240 |
9 | 52814277084 |
10 | 18560214688 |
11 | 7964837004 |
12 | 371b940b94 |
13 | 199a309272 |
14 | c80db88c8 |
15 | 739667d0d |
hex | 4524666a0 |
18560214688 has 72 divisors (see below), whose sum is σ = 39231919188. Its totient is φ = 8636424192.
The previous prime is 18560214649. The next prime is 18560214689. The reversal of 18560214688 is 88641206581.
It can be written as a sum of positive squares in 2 ways, for example, as 12993264144 + 5566950544 = 113988^2 + 74612^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18560214689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 611520 + ... + 641152.
Almost surely, 218560214688 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 18560214688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19615959594).
18560214688 is an abundant number, since it is smaller than the sum of its proper divisors (20671704500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18560214688 is a wasteful number, since it uses less digits than its factorization.
18560214688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29726 (or 29695 counting only the distinct ones).
The product of its (nonzero) digits is 737280, while the sum is 49.
The spelling of 18560214688 in words is "eighteen billion, five hundred sixty million, two hundred fourteen thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •