Search a number
-
+
1105051010001 = 32316015232029
BaseRepresentation
bin10000000101001010001…
…011000100001111010001
310220122022220102122212020
4100011022023010033101
5121101121024310001
62203353050122053
7142560123414141
oct20051213041721
93818286378766
101105051010001
11396716539624
1215a1bb420329
138028a386ba3
143b6b0246921
151db29131736
hex1014a2c43d1

1105051010001 has 8 divisors (see below), whose sum is σ = 1537462274880. Its totient is φ = 704670209232.

The previous prime is 1105051009969. The next prime is 1105051010071. The reversal of 1105051010001 is 1000101505011.

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

It is not a de Polignac number, because 1105051010001 - 25 = 1105051009969 is a prime.

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

It is a Curzon number.

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

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

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

Almost surely, 21105051010001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16015232055.

The product of its (nonzero) digits is 25, while the sum is 15.

Adding to 1105051010001 its reverse (1000101505011), we get a palindrome (2105152515012).

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

Divisors: 1 3 23 69 16015232029 48045696087 368350336667 1105051010001