Base | Representation |
---|---|
bin | 1000011110100111111010… |
… | …01100111110010001000001 |
3 | 2110000101110201101101001102 |
4 | 10033103331030332101001 |
5 | 4420432220430213212 |
6 | 103353042200144145 |
7 | 3633004523011202 |
oct | 417237514762101 |
9 | 73011421341042 |
10 | 18644406101057 |
11 | 5a39059204820 |
12 | 21114b1a68055 |
13 | a5321054a409 |
14 | 4865734855a9 |
15 | 224eb544e5c2 |
hex | 10f4fd33e441 |
18644406101057 has 8 divisors (see below), whose sum is σ = 20339468397120. Its totient is φ = 16949363186160.
The previous prime is 18644406101021. The next prime is 18644406101099. The reversal of 18644406101057 is 75010160444681.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 18644406101057 - 214 = 18644406084673 is a prime.
It is a super-2 number, since 2×186444061010572 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (18644406101257) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2796182 + ... + 6716207.
It is an arithmetic number, because the mean of its divisors is an integer number (2542433549640).
Almost surely, 218644406101057 is an apocalyptic number.
It is an amenable number.
18644406101057 is a deficient number, since it is larger than the sum of its proper divisors (1695062296063).
18644406101057 is a wasteful number, since it uses less digits than its factorization.
18644406101057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9690583.
The product of its (nonzero) digits is 645120, while the sum is 47.
The spelling of 18644406101057 in words is "eighteen trillion, six hundred forty-four billion, four hundred six million, one hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •