Search a number
-
+
100050510505 = 51113113886261
BaseRepresentation
bin101110100101101111…
…0011010001010101001
3100120020200200112122011
41131023132122022221
53114400412314010
6113543525355521
710141226210311
oct1351336321251
9316220615564
10100050510505
11394819a5420
1217482868ba1
13958611630a
144bb1a4c441
1529088b5a8a
hex174b79a2a9

100050510505 has 16 divisors (see below), whose sum is σ = 131975034048. Its totient is φ = 72208552000.

The previous prime is 100050510503. The next prime is 100050510529. The reversal of 100050510505 is 505015050001.

It is not a de Polignac number, because 100050510505 - 21 = 100050510503 is a prime.

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

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

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

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

Almost surely, 2100050510505 is an apocalyptic number.

It is an amenable number.

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

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

100050510505 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 13886408.

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

Adding to 100050510505 its reverse (505015050001), we get a palindrome (605065560506).

It can be divided in two parts, 1000 and 50510505, that added together give a palindrome (50511505).

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

Divisors: 1 5 11 55 131 655 1441 7205 13886261 69431305 152748871 763744355 1819100191 9095500955 20010102101 100050510505