Search a number
-
+
10115201128 = 239713035053
BaseRepresentation
bin10010110101110100…
…11011100001101000
3222002221112110100211
421122322123201220
5131203442414003
64351415510504
7505443535204
oct113272334150
928087473324
1010115201128
11432084935a
121b63688434
13c52824016
146bd58db04
153e306696d
hex25ae9b868

10115201128 has 16 divisors (see below), whose sum is σ = 19161529380. Its totient is φ = 5005459968.

The previous prime is 10115201113. The next prime is 10115201147. The reversal of 10115201128 is 82110251101.

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

It can be written as a sum of positive squares in 2 ways, for example, as 10031624964 + 83576164 = 100158^2 + 9142^2 .

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

It is an unprimeable number.

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, 6516751 + ... + 6518302.

Almost surely, 210115201128 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13035156 (or 13035152 counting only the distinct ones).

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

Adding to 10115201128 its reverse (82110251101), we get a palindrome (92225452229).

The spelling of 10115201128 in words is "ten billion, one hundred fifteen million, two hundred one thousand, one hundred twenty-eight".

Divisors: 1 2 4 8 97 194 388 776 13035053 26070106 52140212 104280424 1264400141 2528800282 5057600564 10115201128