Search a number
-
+
101631050 = 2522032621
BaseRepresentation
bin1100000111011…
…00010001001010
321002020101120222
412003230101022
5202004143200
614030150042
72342564303
oct603542112
9232211528
10101631050
1152405a04
122a052322
1318095021
14d6d77aa
158dc7d85
hex60ec44a

101631050 has 12 divisors (see below), whose sum is σ = 189033846. Its totient is φ = 40652400.

The previous prime is 101631037. The next prime is 101631053. The reversal of 101631050 is 50136101.

It can be written as a sum of positive squares in 3 ways, for example, as 93296281 + 8334769 = 9659^2 + 2887^2 .

It is not an unprimeable number, because it can be changed into a prime (101631053) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1016261 + ... + 1016360.

Almost surely, 2101631050 is an apocalyptic number.

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

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

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

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

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

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

The square root of 101631050 is about 10081.2226441042. Note that the first 3 decimals coincide. The cubic root of 101631050 is about 466.6688406928.

Adding to 101631050 its reverse (50136101), we get a palindrome (151767151).

The spelling of 101631050 in words is "one hundred one million, six hundred thirty-one thousand, fifty".

Divisors: 1 2 5 10 25 50 2032621 4065242 10163105 20326210 50815525 101631050