Search a number
-
+
43333313126401 is a prime number
BaseRepresentation
bin10011101101001010100101…
…01111000110000000000001
312200102121212002122110220001
421312211102233012000001
521134433111130021101
6232055014344520001
712061504616114614
oct1166452257060001
9180377762573801
1043333313126401
1112897611620a71
124a3a352a80001
131b2441081827c
14a9b4b499417b
155022eb540901
hex276952bc6001

43333313126401 has 2 divisors, whose sum is σ = 43333313126402. Its totient is φ = 43333313126400.

The previous prime is 43333313126249. The next prime is 43333313126471. The reversal of 43333313126401 is 10462131333334.

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., 32920042284801 + 10413270841600 = 5737599^2 + 3226960^2 .

It is a cyclic number.

It is not a de Polignac number, because 43333313126401 - 215 = 43333313093633 is a prime.

It is not a weakly prime, because it can be changed into another prime (43333313126471) 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, 21666656563200 + 21666656563201.

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

Almost surely, 243333313126401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 37.

Adding to 43333313126401 its reverse (10462131333334), we get a palindrome (53795444459735).

The spelling of 43333313126401 in words is "forty-three trillion, three hundred thirty-three billion, three hundred thirteen million, one hundred twenty-six thousand, four hundred one".