Base | Representation |
---|---|
bin | 1000100111100110111101… |
… | …11100010110000000110011 |
3 | 2111002220100122021210210210 |
4 | 10103303132330112000303 |
5 | 4441012010313230312 |
6 | 104150541150555203 |
7 | 3664214244316236 |
oct | 423633674260063 |
9 | 74086318253723 |
10 | 18953136070707 |
11 | 6047a86228473 |
12 | 21612b2b08b03 |
13 | a76371bc2727 |
14 | 49749dbcb41d |
15 | 22d03424ae3c |
hex | 113cdef16033 |
18953136070707 has 8 divisors (see below), whose sum is σ = 25648024931776. Its totient is φ = 12446835628392.
The previous prime is 18953136070703. The next prime is 18953136070711. The reversal of 18953136070707 is 70707063135981.
It is an interprime number because it is at equal distance from previous prime (18953136070703) and next prime (18953136070711).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 18953136070707 - 22 = 18953136070703 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (18953136070703) 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, 47147104453 + ... + 47147104854.
It is an arithmetic number, because the mean of its divisors is an integer number (3206003116472).
Almost surely, 218953136070707 is an apocalyptic number.
18953136070707 is a deficient number, since it is larger than the sum of its proper divisors (6694888861069).
18953136070707 is an equidigital number, since it uses as much as digits as its factorization.
18953136070707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94294209377.
The product of its (nonzero) digits is 6667920, while the sum is 57.
The spelling of 18953136070707 in words is "eighteen trillion, nine hundred fifty-three billion, one hundred thirty-six million, seventy thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •