Search a number
-
+
33531550145 = 56706310029
BaseRepresentation
bin11111001110101000…
…101101100111000001
310012112212112020102122
4133032220231213001
51022133034101040
623223145254025
72264641321262
oct371650554701
9105485466378
1033531550145
111324775aa15
1265b9794315
133214c2a142
1418a149a969
15d13bb91b5
hex7cea2d9c1

33531550145 has 4 divisors (see below), whose sum is σ = 40237860180. Its totient is φ = 26825240112.

The previous prime is 33531550141. The next prime is 33531550163. The reversal of 33531550145 is 54105513533.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 16235091889 + 17296458256 = 127417^2 + 131516^2 .

It is a cyclic number.

It is not a de Polignac number, because 33531550145 - 22 = 33531550141 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (33531550141) 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 in 3 ways as a sum of consecutive naturals, for example, 3353155010 + ... + 3353155019.

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

Almost surely, 233531550145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6706310034.

The product of its (nonzero) digits is 67500, while the sum is 35.

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

Divisors: 1 5 6706310029 33531550145