Search a number
-
+
100501051055 = 5593111095439
BaseRepresentation
bin101110110011001010…
…1000101011010101111
3100121102002110101002012
41131212111011122233
53121311232113210
6114100342151435
710155336560516
oct1354625053257
9317362411065
10100501051055
1139693250189
121758972257b
139628572062
144c1580b67d
15293320e305
hex17665456af

100501051055 has 16 divisors (see below), whose sum is σ = 123039820800. Its totient is φ = 78783900960.

The previous prime is 100501050971. The next prime is 100501051069. The reversal of 100501051055 is 550150105001.

It is a happy number.

It is not a de Polignac number, because 100501051055 - 212 = 100501046959 is a prime.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2100501051055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1095814.

The product of its (nonzero) digits is 625, while the sum is 23.

Adding to 100501051055 its reverse (550150105001), we get a palindrome (650651156056).

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

Divisors: 1 5 59 295 311 1555 18349 91745 1095439 5477195 64630901 323154505 340681529 1703407645 20100210211 100501051055