Base | Representation |
---|---|
bin | 1000011111010110010101… |
… | …00010100110100000000011 |
3 | 2110002202210102110011221222 |
4 | 10033223022202212200003 |
5 | 4421334234414433033 |
6 | 103412323034505255 |
7 | 3634546205063114 |
oct | 417531242464003 |
9 | 73082712404858 |
10 | 18669325936643 |
11 | 5a48686868068 |
12 | 21162a759522b |
13 | a55682296765 |
14 | 487858d2220b |
15 | 225973089598 |
hex | 10faca8a6803 |
18669325936643 has 4 divisors (see below), whose sum is σ = 18669349605768. Its totient is φ = 18669302267520.
The previous prime is 18669325936621. The next prime is 18669325936687. The reversal of 18669325936643 is 34663952396681.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 18669325936643 - 26 = 18669325936579 is a prime.
It is a super-2 number, since 2×186693259366432 (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 (18669325936603) 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, 10609121 + ... + 12243042.
It is an arithmetic number, because the mean of its divisors is an integer number (4667337401442).
Almost surely, 218669325936643 is an apocalyptic number.
18669325936643 is a deficient number, since it is larger than the sum of its proper divisors (23669125).
18669325936643 is an equidigital number, since it uses as much as digits as its factorization.
18669325936643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23669124.
The product of its digits is 906992640, while the sum is 71.
The spelling of 18669325936643 in words is "eighteen trillion, six hundred sixty-nine billion, three hundred twenty-five million, nine hundred thirty-six thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •