Search a number
-
+
100050100550 = 2522001002011
BaseRepresentation
bin101110100101101110…
…0110110000101000110
3100120020122220201021122
41131023130312011012
53114400311204200
6113543512513542
710141222552151
oct1351334660506
9316218821248
10100050100550
1139481745414
12174826ab8b2
13958600183a
144bb1982c98
152908834385
hex174b736146

100050100550 has 12 divisors (see below), whose sum is σ = 186093187116. Its totient is φ = 40020040200.

The previous prime is 100050100541. The next prime is 100050100589. The reversal of 100050100550 is 55001050001.

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

It is a congruent number.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 1000500956 + ... + 1000501055.

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

Almost surely, 2100050100550 is an apocalyptic number.

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

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

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

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

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

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

Adding to 100050100550 its reverse (55001050001), we get a palindrome (155051150551).

The spelling of 100050100550 in words is "one hundred billion, fifty million, one hundred thousand, five hundred fifty".

Divisors: 1 2 5 10 25 50 2001002011 4002004022 10005010055 20010020110 50025050275 100050100550