Search a number
-
+
33545154061 is a prime number
BaseRepresentation
bin11111001111011100…
…100110111000001101
310012120211010101111101
4133033130212320031
51022200024412221
623224353023101
72265165050656
oct371734467015
9105524111441
1033545154061
1113254401821
126602254a91
1332179b11b3
1418a31dc52d
15d14ea4d91
hex7cf726e0d

33545154061 has 2 divisors, whose sum is σ = 33545154062. Its totient is φ = 33545154060.

The previous prime is 33545154031. The next prime is 33545154067. The reversal of 33545154061 is 16045154533.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 27512525161 + 6032628900 = 165869^2 + 77670^2 .

It is a cyclic number.

It is not a de Polignac number, because 33545154061 - 211 = 33545152013 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 33545154061.

It is a congruent number.

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

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

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

Almost surely, 233545154061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 33545154061 in words is "thirty-three billion, five hundred forty-five million, one hundred fifty-four thousand, sixty-one".