Search a number
-
+
10115201131 = 729127392351
BaseRepresentation
bin10010110101110100…
…11011100001101011
3222002221112110100221
421122322123201223
5131203442414011
64351415510511
7505443535210
oct113272334153
928087473327
1010115201131
114320849362
121b63688437
13c52824019
146bd58db07
153e3066971
hex25ae9b86b

10115201131 has 16 divisors (see below), whose sum is σ = 12053053440. Its totient is φ = 8305264800.

The previous prime is 10115201113. The next prime is 10115201147. The reversal of 10115201131 is 13110251101.

It is a happy number.

It is not a de Polignac number, because 10115201131 - 25 = 10115201099 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 170395 + ... + 221956.

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

Almost surely, 210115201131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 392514.

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 10115201131 its reverse (13110251101), we get a palindrome (23225452232).

The spelling of 10115201131 in words is "ten billion, one hundred fifteen million, two hundred one thousand, one hundred thirty-one".

Divisors: 1 7 29 127 203 889 3683 25781 392351 2746457 11378179 49828577 79647253 348800039 1445028733 10115201131