Search a number
-
+
100001532 = 22373114157
BaseRepresentation
bin1011111010111…
…10011011111100
320222011121022110
411331132123330
5201100022112
613531214020
72322666441
oct575363374
9228147273
10100001532
11514a26a4
12295a7310
1317944407
14d3d19c8
158ba513c
hex5f5e6fc

100001532 has 24 divisors (see below), whose sum is σ = 236535376. Its totient is φ = 32876928.

The previous prime is 100001507. The next prime is 100001533. The reversal of 100001532 is 235100001.

It is a Harshad number since it is a multiple of its sum of digits (12).

It is a congruent number.

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

Almost surely, 2100001532 is an apocalyptic number.

100001532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

100001532 is an abundant number, since it is smaller than the sum of its proper divisors (136533844).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 12.

The square root of 100001532 is about 10000.0765997066. The cubic root of 100001532 is about 464.1612536539.

Adding to 100001532 its reverse (235100001), we get a palindrome (335101533).

The spelling of 100001532 in words is "one hundred million, one thousand, five hundred thirty-two".

Divisors: 1 2 3 4 6 12 73 146 219 292 438 876 114157 228314 342471 456628 684942 1369884 8333461 16666922 25000383 33333844 50000766 100001532