Search a number
-
+
10679735051 = 101105739951
BaseRepresentation
bin10011111001000111…
…11101001100001011
31000120021210202022122
421330203331030023
5133333003010201
64523423441455
7525440151536
oct117443751413
930507722278
1010679735051
114590483017
1220a075628b
13101278296b
14734543a1d
154278cae1b
hex27c8fd30b

10679735051 has 4 divisors (see below), whose sum is σ = 10785475104. Its totient is φ = 10573995000.

The previous prime is 10679735021. The next prime is 10679735111. The reversal of 10679735051 is 15053797601.

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

It is a cyclic number.

It is not a de Polignac number, because 10679735051 - 26 = 10679734987 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10679734993 and 10679735011.

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

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

Almost surely, 210679735051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 105740052.

The product of its (nonzero) digits is 198450, while the sum is 44.

The spelling of 10679735051 in words is "ten billion, six hundred seventy-nine million, seven hundred thirty-five thousand, fifty-one".

Divisors: 1 101 105739951 10679735051