Search a number
-
+
10010501315 = 573127215953
BaseRepresentation
bin10010101001010110…
…00010000011000011
3221211122112011012222
421110223002003003
5131000142020230
64333155441255
7503032600013
oct112453020303
927748464188
1010010501315
114277737891
121b345b622b
13c36c26279
146ad6d7c43
153d8c846e5
hex254ac20c3

10010501315 has 16 divisors (see below), whose sum is σ = 12273097728. Its totient is φ = 7836466176.

The previous prime is 10010501311. The next prime is 10010501317. The reversal of 10010501315 is 51310501001.

It is a cyclic number.

It is not a de Polignac number, because 10010501315 - 22 = 10010501311 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 210010501315 is an apocalyptic number.

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

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

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

The sum of its prime factors is 216158.

The product of its (nonzero) digits is 75, while the sum is 17.

The spelling of 10010501315 in words is "ten billion, ten million, five hundred one thousand, three hundred fifteen".

Divisors: 1 5 73 127 365 635 9271 46355 215953 1079765 15764569 27426031 78822845 137130155 2002100263 10010501315