Search a number
-
+
100000561106 = 2142735038739
BaseRepresentation
bin101110100100001111…
…1110111011111010010
3100120010012200211221102
41131020133313133102
53114300120423411
6113534543024402
710140051513245
oct1351037673722
9316105624842
10100000561106
1139456789726
1217469b9b102
139578977c64
144ba916925c
1529042ead3b
hex17487f77d2

100000561106 has 8 divisors (see below), whose sum is σ = 150105962160. Its totient is φ = 49965240388.

The previous prime is 100000561103. The next prime is 100000561139. The reversal of 100000561106 is 601165000001.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (100000561103) 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 3 ways as a sum of consecutive naturals, for example, 17516516 + ... + 17522223.

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

Almost surely, 2100000561106 is an apocalyptic number.

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

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

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

The sum of its prime factors is 35040168.

The product of its (nonzero) digits is 180, while the sum is 20.

Adding to 100000561106 its reverse (601165000001), we get a palindrome (701165561107).

The spelling of 100000561106 in words is "one hundred billion, five hundred sixty-one thousand, one hundred six".

Divisors: 1 2 1427 2854 35038739 70077478 50000280553 100000561106