Base | Representation |
---|---|
bin | 1000100000011100011110… |
… | …00100111111010011010111 |
3 | 2110020100222210220102021212 |
4 | 10100032033010333103113 |
5 | 4422443400123230311 |
6 | 103441511440532035 |
7 | 3640351323043244 |
oct | 420161704772327 |
9 | 73210883812255 |
10 | 18706983023831 |
11 | 5a62650255023 |
12 | 212165692101b |
13 | a590a3b2a57b |
14 | 4895cc2905cb |
15 | 226929024c8b |
hex | 11038f13f4d7 |
18706983023831 has 2 divisors, whose sum is σ = 18706983023832. Its totient is φ = 18706983023830.
The previous prime is 18706983023791. The next prime is 18706983023843. The reversal of 18706983023831 is 13832038960781.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (13832038960781) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-18706983023831 is a prime.
It is a super-2 number, since 2×187069830238312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18706983023851) 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 as a sum of consecutive naturals, namely, 9353491511915 + 9353491511916.
It is an arithmetic number, because the mean of its divisors is an integer number (9353491511916).
Almost surely, 218706983023831 is an apocalyptic number.
18706983023831 is a deficient number, since it is larger than the sum of its proper divisors (1).
18706983023831 is an equidigital number, since it uses as much as digits as its factorization.
18706983023831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10450944, while the sum is 59.
The spelling of 18706983023831 in words is "eighteen trillion, seven hundred six billion, nine hundred eighty-three million, twenty-three thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •