Search a number
-
+
100110131315 = 5232251138671
BaseRepresentation
bin101110100111100000…
…1110110000001110011
3100120101211212121000022
41131033001312001303
53120011143200230
6113553455314055
710142552035025
oct1351701660163
9316354777008
10100110131315
1139502617417
121749a81b92b
13959558c7bc
144bb992c015
15290dc411e5
hex174f076073

100110131315 has 16 divisors (see below), whose sum is σ = 125364105216. Its totient is φ = 76600629600.

The previous prime is 100110131299. The next prime is 100110131321. The reversal of 100110131315 is 513131011001.

It is a happy number.

It is not a de Polignac number, because 100110131315 - 24 = 100110131299 is a prime.

It is a Duffinian number.

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

It is an unprimeable number.

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, 2569430 + ... + 2608100.

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

Almost surely, 2100110131315 is an apocalyptic number.

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

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

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

The sum of its prime factors is 61210.

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

Adding to 100110131315 its reverse (513131011001), we get a palindrome (613241142316).

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

Divisors: 1 5 23 115 22511 38671 112555 193355 517753 889433 2588765 4447165 870522881 4352614405 20022026263 100110131315