Search a number
-
+
100500101051 = 771428947147
BaseRepresentation
bin101110110011001000…
…1011101011110111011
3100121102000200002220212
41131212101131132323
53121311011213201
6114100305541335
710155325523030
oct1354621353673
9317360602825
10100500101051
1139692761459
121758934484b
1396282cb81c
144c15641387
1529330c2abb
hex176645d7bb

100500101051 has 16 divisors (see below), whose sum is σ = 116504593920. Its totient is φ = 84908060160.

The previous prime is 100500101047. The next prime is 100500101063. The reversal of 100500101051 is 150101005001.

It is not a de Polignac number, because 100500101051 - 22 = 100500101047 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2108060 + ... + 2155206.

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

Almost surely, 2100500101051 is an apocalyptic number.

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

100500101051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 51514.

The product of its (nonzero) digits is 25, while the sum is 14.

Adding to 100500101051 its reverse (150101005001), we get a palindrome (250601106052).

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

Divisors: 1 7 71 497 4289 30023 47147 304519 330029 2131633 3347437 23432059 202213483 1415494381 14357157293 100500101051