Search a number
-
+
1000196295110 = 25100019629511
BaseRepresentation
bin11101000111000000101…
…10000100100111000110
310112121200101210020202022
432203200112010213012
5112341400222420420
62043252301443142
7132155540142665
oct16434026044706
93477611706668
101000196295110
113561a9808361
12141a178704b2
1373419b566ac
14365a4542ddc
151b03dadcc25
hexe8e05849c6

1000196295110 has 8 divisors (see below), whose sum is σ = 1800353331216. Its totient is φ = 400078518040.

The previous prime is 1000196295101. The next prime is 1000196295157. The reversal of 1000196295110 is 115926910001.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 50009814746 + ... + 50009814765.

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

Almost surely, 21000196295110 is an apocalyptic number.

1000196295110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 100019629518.

The product of its (nonzero) digits is 4860, while the sum is 35.

The spelling of 1000196295110 in words is "one trillion, one hundred ninety-six million, two hundred ninety-five thousand, one hundred ten".

Divisors: 1 2 5 10 100019629511 200039259022 500098147555 1000196295110