Base | Representation |
---|---|
bin | 1000011000110000001110… |
… | …00100001011110011101001 |
3 | 2102022002212001000121212201 |
4 | 10030120013010023303221 |
5 | 4404131131233401343 |
6 | 103120244012140201 |
7 | 3612304333233520 |
oct | 414300704136351 |
9 | 72262761017781 |
10 | 18442708106473 |
11 | 5970565a20112 |
12 | 209a3a1767661 |
13 | a3a1a8504721 |
14 | 47a8bba814b7 |
15 | 21eb0cdc094d |
hex | 10c60710bce9 |
18442708106473 has 4 divisors (see below), whose sum is σ = 21077380693120. Its totient is φ = 15808035519828.
The previous prime is 18442708106453. The next prime is 18442708106491. The reversal of 18442708106473 is 37460180724481.
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 not a de Polignac number, because 18442708106473 - 29 = 18442708105961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (18442708106443) 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, 1317336293313 + ... + 1317336293326.
It is an arithmetic number, because the mean of its divisors is an integer number (5269345173280).
Almost surely, 218442708106473 is an apocalyptic number.
It is an amenable number.
18442708106473 is a deficient number, since it is larger than the sum of its proper divisors (2634672586647).
18442708106473 is an equidigital number, since it uses as much as digits as its factorization.
18442708106473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2634672586646.
The product of its (nonzero) digits is 7225344, while the sum is 55.
The spelling of 18442708106473 in words is "eighteen trillion, four hundred forty-two billion, seven hundred eight million, one hundred six thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •