Base | Representation |
---|---|
bin | 11010001101101100111… |
… | …001100111110100100101 |
3 | 20101012202221102101110121 |
4 | 122031230321213310211 |
5 | 214003301043413134 |
6 | 3455320554521541 |
7 | 244101553154662 |
oct | 32155471476445 |
9 | 6335687371417 |
10 | 1801418341669 |
11 | 634a82766791 |
12 | 2511634362b1 |
13 | 100b4704632b |
14 | 63290cd6a69 |
15 | 31cd4322ab4 |
hex | 1a36ce67d25 |
1801418341669 has 2 divisors, whose sum is σ = 1801418341670. Its totient is φ = 1801418341668.
The previous prime is 1801418341609. The next prime is 1801418341687. The reversal of 1801418341669 is 9661438141081.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 920707416225 + 880710925444 = 959535^2 + 938462^2 .
It is a cyclic number.
It is not a de Polignac number, because 1801418341669 - 227 = 1801284123941 is a prime.
It is a super-2 number, since 2×18014183416692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1801418341609) 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, 900709170834 + 900709170835.
It is an arithmetic number, because the mean of its divisors is an integer number (900709170835).
Almost surely, 21801418341669 is an apocalyptic number.
It is an amenable number.
1801418341669 is a deficient number, since it is larger than the sum of its proper divisors (1).
1801418341669 is an equidigital number, since it uses as much as digits as its factorization.
1801418341669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 995328, while the sum is 52.
The spelling of 1801418341669 in words is "one trillion, eight hundred one billion, four hundred eighteen million, three hundred forty-one thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •