Search a number
-
+
10490198167 = 19552115693
BaseRepresentation
bin10011100010100001…
…11011100010010111
31000002002011021121001
421301100323202113
5132440442320132
64452533204131
7520646133061
oct116120734227
930062137531
1010490198167
1144a3497169
122049190647
13cb241cc67
147172c6731
15415e3bce7
hex27143b897

10490198167 has 4 divisors (see below), whose sum is σ = 11042313880. Its totient is φ = 9938082456.

The previous prime is 10490198149. The next prime is 10490198197. The reversal of 10490198167 is 76189109401.

10490198167 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10490198167 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10490198137) by changing a digit.

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, 276057828 + ... + 276057865.

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

Almost surely, 210490198167 is an apocalyptic number.

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

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

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

The sum of its prime factors is 552115712.

The product of its (nonzero) digits is 108864, while the sum is 46.

The spelling of 10490198167 in words is "ten billion, four hundred ninety million, one hundred ninety-eight thousand, one hundred sixty-seven".

Divisors: 1 19 552115693 10490198167