Search a number
-
+
33102011230 = 253310201123
BaseRepresentation
bin11110110101000010…
…001001101101011110
310011102221021101210221
4132311002021231132
51020243103324410
623112402551554
72251204311241
oct366502115536
9104387241727
1033102011230
1113047249a82
1264b99685ba
133176c456c2
141860407258
15cdb11d4da
hex7b5089b5e

33102011230 has 8 divisors (see below), whose sum is σ = 59583620232. Its totient is φ = 13240804488.

The previous prime is 33102011219. The next prime is 33102011231. The reversal of 33102011230 is 3211020133.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (33102011231) 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, 1655100552 + ... + 1655100571.

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

Almost surely, 233102011230 is an apocalyptic number.

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

33102011230 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3310201130.

The product of its (nonzero) digits is 108, while the sum is 16.

Adding to 33102011230 its reverse (3211020133), we get a palindrome (36313031363).

The spelling of 33102011230 in words is "thirty-three billion, one hundred two million, eleven thousand, two hundred thirty".

Divisors: 1 2 5 10 3310201123 6620402246 16551005615 33102011230