Base | Representation |
---|---|
bin | 1000100000101010000010… |
… | …00010001001010000010011 |
3 | 2110021001210012120111101021 |
4 | 10100111001002021100103 |
5 | 4423103302434334112 |
6 | 103445114120420311 |
7 | 3641026616611354 |
oct | 420250102112023 |
9 | 73231705514337 |
10 | 18714263589907 |
11 | 5a65746a0a086 |
12 | 2122b49017697 |
13 | a599942b8732 |
14 | 489abd1a1d2b |
15 | 226c032ae907 |
hex | 110541089413 |
18714263589907 has 2 divisors, whose sum is σ = 18714263589908. Its totient is φ = 18714263589906.
The previous prime is 18714263589893. The next prime is 18714263589977. The reversal of 18714263589907 is 70998536241781.
It is an a-pointer prime, because the next prime (18714263589977) can be obtained adding 18714263589907 to its sum of digits (70).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 18714263589907 - 27 = 18714263589779 is a prime.
It is not a weakly prime, because it can be changed into another prime (18714263589977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9357131794953 + 9357131794954.
It is an arithmetic number, because the mean of its divisors is an integer number (9357131794954).
It is a 1-persistent number, because it is pandigital, but 2⋅18714263589907 = 37428527179814 is not.
Almost surely, 218714263589907 is an apocalyptic number.
18714263589907 is a deficient number, since it is larger than the sum of its proper divisors (1).
18714263589907 is an equidigital number, since it uses as much as digits as its factorization.
18714263589907 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 182891520, while the sum is 70.
The spelling of 18714263589907 in words is "eighteen trillion, seven hundred fourteen billion, two hundred sixty-three million, five hundred eighty-nine thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •