Search a number
-
+
10205114163051 = 33401704721017
BaseRepresentation
bin1001010010000001000000…
…1101000101111101101011
31100010121011221201100011010
42110200100031011331223
52314200033211204201
633412055325235003
72102203146066543
oct224402015057553
940117157640133
1010205114163051
113284a67997655
1211899a0102a63
13590451b68482
14273d0450c323
1512a6d236ebd6
hex94810345f6b

10205114163051 has 4 divisors (see below), whose sum is σ = 13606818884072. Its totient is φ = 6803409442032.

The previous prime is 10205114163047. The next prime is 10205114163053. The reversal of 10205114163051 is 15036141150201.

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

It is not a de Polignac number, because 10205114163051 - 22 = 10205114163047 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10205114163053) 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, 1700852360506 + ... + 1700852360511.

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

Almost surely, 210205114163051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3401704721020.

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

The spelling of 10205114163051 in words is "ten trillion, two hundred five billion, one hundred fourteen million, one hundred sixty-three thousand, fifty-one".

Divisors: 1 3 3401704721017 10205114163051