Search a number
-
+
10130110112 = 25316565941
BaseRepresentation
bin10010110111100110…
…10011011010100000
3222010222120220122102
421123303103122200
5131221302010422
64353111225532
7506014341503
oct113363233240
928128526572
1010130110112
114329201731
121b686782a8
13c559440c5
146c155113a
153e450e192
hex25bcd36a0

10130110112 has 12 divisors (see below), whose sum is σ = 19943654346. Its totient is φ = 5065055040.

The previous prime is 10130110099. The next prime is 10130110121. The reversal of 10130110112 is 21101103101.

It is a happy number.

10130110112 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 only one way, i.e., 7618496656 + 2511613456 = 87284^2 + 50116^2 .

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

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 as a sum of consecutive naturals, namely, 158282939 + ... + 158283002.

Almost surely, 210130110112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 10130110112 its reverse (21101103101), we get a palindrome (31231213213).

The spelling of 10130110112 in words is "ten billion, one hundred thirty million, one hundred ten thousand, one hundred twelve".

Divisors: 1 2 4 8 16 32 316565941 633131882 1266263764 2532527528 5065055056 10130110112