Base | Representation |
---|---|
bin | 1000011111110111110111… |
… | …10111110101110011110101 |
3 | 2110011111021101210000011121 |
4 | 10033323323313311303311 |
5 | 4422133124331112031 |
6 | 103424501550303541 |
7 | 3636054354346636 |
oct | 417737367656365 |
9 | 73144241700147 |
10 | 18687333457141 |
11 | 5a55287616808 |
12 | 21198921b7bb1 |
13 | a57291c2b12b |
14 | 48868674988d |
15 | 226178e2b011 |
hex | 10fefbdf5cf5 |
18687333457141 has 2 divisors, whose sum is σ = 18687333457142. Its totient is φ = 18687333457140.
The previous prime is 18687333457139. The next prime is 18687333457147. The reversal of 18687333457141 is 14175433378681.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16526298215025 + 2161035242116 = 4065255^2 + 1470046^2 .
It is a cyclic number.
It is not a de Polignac number, because 18687333457141 - 21 = 18687333457139 is a prime.
Together with 18687333457139, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 18687333457141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18687333457147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9343666728570 + 9343666728571.
It is an arithmetic number, because the mean of its divisors is an integer number (9343666728571).
Almost surely, 218687333457141 is an apocalyptic number.
It is an amenable number.
18687333457141 is a deficient number, since it is larger than the sum of its proper divisors (1).
18687333457141 is an equidigital number, since it uses as much as digits as its factorization.
18687333457141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 40642560, while the sum is 61.
The spelling of 18687333457141 in words is "eighteen trillion, six hundred eighty-seven billion, three hundred thirty-three million, four hundred fifty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •