Search a number
-
+
46911780290593 is a prime number
BaseRepresentation
bin10101010101010100000000…
…00000000000000000100001
320011002201111121221102011001
422222222000000000000201
522122100311223244333
6243434550243152001
712611156435126041
oct1252520000000041
9204081447842131
1046911780290593
1113a471a0a93a69
125317998375601
1320239b9b7caba
14b82784039721
1556543a502b7d
hex2aaa80000021

46911780290593 has 2 divisors, whose sum is σ = 46911780290594. Its totient is φ = 46911780290592.

The previous prime is 46911780290539. The next prime is 46911780290597. The reversal of 46911780290593 is 39509208711964.

Together with previous prime (46911780290539) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 46118455177249 + 793325113344 = 6791057^2 + 890688^2 .

It is a cyclic number.

It is not a de Polignac number, because 46911780290593 - 229 = 46911243419681 is a prime.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅46911780290593 = 93823560581186 is not.

Almost surely, 246911780290593 is an apocalyptic number.

It is an amenable number.

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

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

46911780290593 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 29393280, while the sum is 64.

The spelling of 46911780290593 in words is "forty-six trillion, nine hundred eleven billion, seven hundred eighty million, two hundred ninety thousand, five hundred ninety-three".