Search a number
-
+
100056106011 = 333352035337
BaseRepresentation
bin101110100101111001…
…1110000010000011011
3100120021002012211020010
41131023303300100123
53114403330343021
6113544245333003
710141324603611
oct1351363602033
9316232184203
10100056106011
1139485077404
1217484707163
139587325174
144bb26a76b1
15290911d976
hex174bcf041b

100056106011 has 4 divisors (see below), whose sum is σ = 133408141352. Its totient is φ = 66704070672.

The previous prime is 100056105967. The next prime is 100056106019. The reversal of 100056106011 is 110601650001.

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

It is not a de Polignac number, because 100056106011 - 27 = 100056105883 is a prime.

It is a super-2 number, since 2×1000561060112 (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 (100056106019) by changing a digit.

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

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

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

Almost surely, 2100056106011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 33352035340.

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

Adding to 100056106011 its reverse (110601650001), we get a palindrome (210657756012).

The spelling of 100056106011 in words is "one hundred billion, fifty-six million, one hundred six thousand, eleven".

Divisors: 1 3 33352035337 100056106011