Search a number
-
+
10011010371 = 317351755813
BaseRepresentation
bin10010101001011001…
…11110010101000011
3221211200111000111220
421110230332111003
5131000304312441
64333214410123
7503040120105
oct112454762503
927750430456
1010011010371
114277a5529a
121b34800943
13c37073b9b
146ad7cb575
153d8d35466
hex254b3e543

10011010371 has 16 divisors (see below), whose sum is σ = 14137462944. Its totient is φ = 6279519744.

The previous prime is 10011010357. The next prime is 10011010379. The reversal of 10011010371 is 17301011001.

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

It is not a de Polignac number, because 10011010371 - 29 = 10011009859 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10011010371.

It is not an unprimeable number, because it can be changed into a prime (10011010379) 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 15 ways as a sum of consecutive naturals, for example, 151461 + ... + 207273.

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

Almost surely, 210011010371 is an apocalyptic number.

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

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

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

The sum of its prime factors is 59350.

The product of its (nonzero) digits is 21, while the sum is 15.

Adding to 10011010371 its reverse (17301011001), we get a palindrome (27312021372).

The spelling of 10011010371 in words is "ten billion, eleven million, ten thousand, three hundred seventy-one".

Divisors: 1 3 17 51 3517 10551 55813 59789 167439 179367 948821 2846463 196294321 588882963 3337003457 10011010371