Search a number
-
+
10100151067 = 61165576247
BaseRepresentation
bin10010110100000010…
…00001001100011011
3222001220012211120011
421122001001030123
5131141114313232
64350121142351
7505201603366
oct113201011433
928056184504
1010100151067
1143132a9a96
121b5a62a9b7
13c4c684966
146bb5930dd
153e1a92547
hex25a04131b

10100151067 has 4 divisors (see below), whose sum is σ = 10265727376. Its totient is φ = 9934574760.

The previous prime is 10100151053. The next prime is 10100151073. The reversal of 10100151067 is 76015100101.

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 10100151067 - 211 = 10100149019 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82788063 + ... + 82788184.

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

Almost surely, 210100151067 is an apocalyptic number.

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

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

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

The sum of its prime factors is 165576308.

The product of its (nonzero) digits is 210, while the sum is 22.

Adding to 10100151067 its reverse (76015100101), we get a palindrome (86115251168).

The spelling of 10100151067 in words is "ten billion, one hundred million, one hundred fifty-one thousand, sixty-seven".

Divisors: 1 61 165576247 10100151067