Search a number
-
+
10153530213 = 319178132109
BaseRepresentation
bin10010111010011001…
…01001001101100101
3222012121122202222120
421131030221031211
5131243300431323
64355305220153
7506420403621
oct113514511545
928177582876
1010153530213
114340448592
121b74491659
13c5a754158
146c46ca181
153e65d85e3
hex25d329365

10153530213 has 8 divisors (see below), whose sum is σ = 14250568800. Its totient is φ = 6412755888.

The previous prime is 10153530203. The next prime is 10153530217. The reversal of 10153530213 is 31203535101.

10153530213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 10153530213 - 25 = 10153530181 is a prime.

It is a congruent number.

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

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

Almost surely, 210153530213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 178132131.

The product of its (nonzero) digits is 1350, while the sum is 24.

The spelling of 10153530213 in words is "ten billion, one hundred fifty-three million, five hundred thirty thousand, two hundred thirteen".

Divisors: 1 3 19 57 178132109 534396327 3384510071 10153530213