Search a number
-
+
100001060051 = 4312273102077
BaseRepresentation
bin101110100100010000…
…1110001010011010011
3100120010020122012100212
41131020201301103103
53114300232410201
6113535001434335
710140055662014
oct1351041612323
9316106565325
10100001060051
1139456a9a582
121746a19b9ab
139578ac10a9
144ba925900b
152904398abb
hex17488714d3

100001060051 has 8 divisors (see below), whose sum is σ = 100278160704. Its totient is φ = 99724168960.

The previous prime is 100001060023. The next prime is 100001060059. The reversal of 100001060051 is 150060100001.

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

It is a cyclic number.

It is not a de Polignac number, because 100001060051 - 222 = 99996865747 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 928625 + ... + 1030701.

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

Almost surely, 2100001060051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 104781.

The product of its (nonzero) digits is 30, while the sum is 14.

Adding to 100001060051 its reverse (150060100001), we get a palindrome (250061160052).

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

Divisors: 1 431 2273 102077 979663 43995187 232021021 100001060051