Base | Representation |
---|---|
bin | 11011001101001010000… |
… | …010101001010110010101 |
3 | 20121201122100202201002201 |
4 | 123031022002221112111 |
5 | 221112321030401042 |
6 | 3550505532404501 |
7 | 252033160066333 |
oct | 33151202512625 |
9 | 6551570681081 |
10 | 1869552981397 |
11 | 660966a11aa2 |
12 | 2623b9616731 |
13 | 1073b4b97bba |
14 | 666b5ca0b53 |
15 | 33970cb91b7 |
hex | 1b34a0a9595 |
1869552981397 has 2 divisors, whose sum is σ = 1869552981398. Its totient is φ = 1869552981396.
The previous prime is 1869552981367. The next prime is 1869552981419. The reversal of 1869552981397 is 7931892559681.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1472742436356 + 396810545041 = 1213566^2 + 629929^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1869552981397 is a prime.
It is a super-2 number, since 2×18695529813972 (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 (1869552981367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 934776490698 + 934776490699.
It is an arithmetic number, because the mean of its divisors is an integer number (934776490699).
Almost surely, 21869552981397 is an apocalyptic number.
It is an amenable number.
1869552981397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1869552981397 is an equidigital number, since it uses as much as digits as its factorization.
1869552981397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 293932800, while the sum is 73.
The spelling of 1869552981397 in words is "one trillion, eight hundred sixty-nine billion, five hundred fifty-two million, nine hundred eighty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •