Base | Representation |
---|---|
bin | 1101010000011101110011… |
… | …0011000001011100000100 |
3 | 1220121111120022211002110021 |
4 | 3110013130303001130010 |
5 | 3402310212232214314 |
6 | 51000210435304524 |
7 | 3033055651026232 |
oct | 324073463013404 |
9 | 56544508732407 |
10 | 14576528398084 |
11 | 470a9642a9274 |
12 | 1775041a4b144 |
13 | 819739c00cc3 |
14 | 385717341952 |
15 | 1a4280352324 |
hex | d41dccc1704 |
14576528398084 has 45 divisors (see below), whose sum is σ = 25906291980681. Its totient is φ = 7176471624960.
The previous prime is 14576528398043. The next prime is 14576528398129. The reversal of 14576528398084 is 48089382567541.
The square root of 14576528398084 is 3817922.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 12510524628484 + 2066003769600 = 3537022^2 + 1437360^2 .
It is a Duffinian number.
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 14 ways as a sum of consecutive naturals, for example, 60483520204 + ... + 60483520444.
It is a 1-persistent number, because it is pandigital, but 2⋅14576528398084 = 29153056796168 is not.
Almost surely, 214576528398084 is an apocalyptic number.
14576528398084 is the 3817922-nd square number.
It is an amenable number.
14576528398084 is a deficient number, since it is larger than the sum of its proper divisors (11329763582597).
14576528398084 is an frugal number, since it uses more digits than its factorization.
14576528398084 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 842 (or 332 counting only the distinct ones).
The product of its (nonzero) digits is 464486400, while the sum is 70.
The spelling of 14576528398084 in words is "fourteen trillion, five hundred seventy-six billion, five hundred twenty-eight million, three hundred ninety-eight thousand, eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •