Search a number
-
+
100050050055563 = 907089111029793
BaseRepresentation
bin10110101111111010110111…
…101100010111110110001011
3111010020200200000022210020022
4112233322313230113312023
5101103210000303234223
6552442205233051055
730034243336453466
oct2657726754276613
9433220600283208
10100050050055563
1129973a95a58763
12b27a4533b6a8b
1343a98aa39043a
141a9c63c0522dd
15b877e8750ac8
hex5afeb7b17d8b

100050050055563 has 4 divisors (see below), whose sum is σ = 100050070156248. Its totient is φ = 100050029954880.

The previous prime is 100050050055497. The next prime is 100050050055623. The reversal of 100050050055563 is 365550050050001.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 100050050055563 - 230 = 100048976313739 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3555995 + ... + 14585787.

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

Almost surely, 2100050050055563 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20100684.

The product of its (nonzero) digits is 56250, while the sum is 35.

The spelling of 100050050055563 in words is "one hundred trillion, fifty billion, fifty million, fifty-five thousand, five hundred sixty-three".

Divisors: 1 9070891 11029793 100050050055563