Search a number
-
+
10141798997 = 11921981727
BaseRepresentation
bin10010111000111111…
…11001001001010101
3222011210120202210002
421130133321021111
5131232300031442
64354205541045
7506215604051
oct113437711125
928153522702
1010141798997
114334865770
121b70574785
13c581a75c5
146c2d14c61
153e556c732
hex25c7f9255

10141798997 has 4 divisors (see below), whose sum is σ = 11063780736. Its totient is φ = 9219817260.

The previous prime is 10141798993. The next prime is 10141799011. The reversal of 10141798997 is 79989714101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10141798997 - 22 = 10141798993 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 210141798997 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 921981738.

The product of its (nonzero) digits is 1143072, while the sum is 56.

The spelling of 10141798997 in words is "ten billion, one hundred forty-one million, seven hundred ninety-eight thousand, nine hundred ninety-seven".

Divisors: 1 11 921981727 10141798997