Search a number
BaseRepresentation
bin10010110111111110…
…00110000011101100
3222011012101221201122
421123333012003230
5131223044414012
64353301400112
7506052534305
oct113377060354
928135357648
1010133201132
11432aa22a9a
121b69709038
13c56487002
146c1b177ac
153e491ee72
hex25bfc60ec

10133201132 has 12 divisors (see below), whose sum is σ = 17895791760. Its totient is φ = 5020117776.

The previous prime is 10133201131. The next prime is 10133201161. The reversal of 10133201132 is 23110233101.

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

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

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

Almost surely, 210133201132 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 23241400 (or 23241398 counting only the distinct ones).

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

Adding to 10133201132 its reverse (23110233101), we get a palindrome (33243434233).

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