Search a number
-
+
10051110110001 = 333131847317831
BaseRepresentation
bin1001001001000011010011…
…0110010000001100110001
31022120212200010220212002110
42102100310312100030301
52304134133142010001
633213225524035533
72055111610201332
oct222206466201461
938525603825073
1010051110110001
113225719697154
121163b80532ba9
1357ba7aba886c
1426a695070289
151266bbeb93d6
hex92434d90331

10051110110001 has 16 divisors (see below), whose sum is σ = 13442432375808. Its totient is φ = 6680265358800.

The previous prime is 10051110109981. The next prime is 10051110110011. The reversal of 10051110110001 is 10001101115001.

It is a happy number.

It is not a de Polignac number, because 10051110110001 - 221 = 10051108012849 is a prime.

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

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

Almost surely, 210051110110001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 350012.

The product of its (nonzero) digits is 5, while the sum is 12.

Adding to 10051110110001 its reverse (10001101115001), we get a palindrome (20052211225002).

The spelling of 10051110110001 in words is "ten trillion, fifty-one billion, one hundred ten million, one hundred ten thousand, one".

Divisors: 1 3 331 993 31847 95541 317831 953493 10541357 31624071 105202061 315606183 10121963857 30365891571 3350370036667 10051110110001