Search a number
-
+
1459211695867 is a prime number
BaseRepresentation
bin10101001110111111110…
…010110111011011111011
312011111110222020121020201
4111032333302313123323
5142401431143231432
63034204054503031
7210265424522662
oct25167762673373
95144428217221
101459211695867
11512936a62832
121b697b064a77
13a77abc478c3
14508aa4d9dd9
1527e5659aee7
hex153bfcb76fb

1459211695867 has 2 divisors, whose sum is σ = 1459211695868. Its totient is φ = 1459211695866.

The previous prime is 1459211695801. The next prime is 1459211695883. The reversal of 1459211695867 is 7685961129541.

It is a strong prime.

It is an emirp because it is prime and its reverse (7685961129541) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1459211695867 is a prime.

It is a super-2 number, since 2×14592116958672 (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1459211695799 and 1459211695808.

It is not a weakly prime, because it can be changed into another prime (1459211692867) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 729605847933 + 729605847934.

It is an arithmetic number, because the mean of its divisors is an integer number (729605847934).

Almost surely, 21459211695867 is an apocalyptic number.

1459211695867 is a deficient number, since it is larger than the sum of its proper divisors (1).

1459211695867 is an equidigital number, since it uses as much as digits as its factorization.

1459211695867 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 32659200, while the sum is 64.

The spelling of 1459211695867 in words is "one trillion, four hundred fifty-nine billion, two hundred eleven million, six hundred ninety-five thousand, eight hundred sixty-seven".