Search a number
-
+
10690441142 = 25345220571
BaseRepresentation
bin10011111010011001…
…10010111110110110
31000121000221200022112
421331030302332312
5133343223104032
64524445131022
7525630151613
oct117514627666
930530850275
1010690441142
114596525727
1220a4259a72
131014a60a24
14735b2d50a
154287e31b2
hex27d332fb6

10690441142 has 4 divisors (see below), whose sum is σ = 16035661716. Its totient is φ = 5345220570.

The previous prime is 10690441133. The next prime is 10690441159. The reversal of 10690441142 is 24114409601.

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

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2672610284 + ... + 2672610287.

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

Almost surely, 210690441142 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5345220573.

The product of its (nonzero) digits is 6912, while the sum is 32.

The spelling of 10690441142 in words is "ten billion, six hundred ninety million, four hundred forty-one thousand, one hundred forty-two".

Divisors: 1 2 5345220571 10690441142