Base | Representation |
---|---|
bin | 1000011011001011100001… |
… | …01000010010011110001001 |
3 | 2102121002001121122100212101 |
4 | 10031211300220102132021 |
5 | 4412012404342313012 |
6 | 103222433145313401 |
7 | 3621315422665513 |
oct | 415456050223611 |
9 | 72532047570771 |
10 | 18526083557257 |
11 | 59a2960215341 |
12 | 20b258ba95861 |
13 | a45004a483a3 |
14 | 48094ac36bb3 |
15 | 221d8c897d57 |
hex | 10d970a12789 |
18526083557257 has 4 divisors (see below), whose sum is σ = 18639740511760. Its totient is φ = 18412426602756.
The previous prime is 18526083557171. The next prime is 18526083557287. The reversal of 18526083557257 is 75275538062581.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-18526083557257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (18526083557287) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 56828477007 + ... + 56828477332.
It is an arithmetic number, because the mean of its divisors is an integer number (4659935127940).
Almost surely, 218526083557257 is an apocalyptic number.
It is an amenable number.
18526083557257 is a deficient number, since it is larger than the sum of its proper divisors (113656954503).
18526083557257 is a wasteful number, since it uses less digits than its factorization.
18526083557257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113656954502.
The product of its (nonzero) digits is 141120000, while the sum is 64.
The spelling of 18526083557257 in words is "eighteen trillion, five hundred twenty-six billion, eighty-three million, five hundred fifty-seven thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •