Search a number
-
+
33102141469 is a prime number
BaseRepresentation
bin11110110101000010…
…101001100000011101
310011102221112000110121
4132311002221200131
51020243122011334
623112405434541
72251205363035
oct366502514035
9104387460417
1033102141469
1113047328911
1264b9a0ba51
133176c8ca77
14186043c8c5
15cdb146db4
hex7b50a981d

33102141469 has 2 divisors, whose sum is σ = 33102141470. Its totient is φ = 33102141468.

The previous prime is 33102141421. The next prime is 33102141509. The reversal of 33102141469 is 96414120133.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 20566428100 + 12535713369 = 143410^2 + 111963^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 33102141469 - 29 = 33102140957 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 233102141469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15552, while the sum is 34.

The spelling of 33102141469 in words is "thirty-three billion, one hundred two million, one hundred forty-one thousand, four hundred sixty-nine".