Search a number
-
+
15110100109973 = 112124876860413
BaseRepresentation
bin1101101111100001100000…
…1001100100101010010101
31222111111210212010110200102
43123320120021210222111
53440030441112004343
652045252325023445
73116445236530631
oct333703011445225
958444725113612
1015110100109973
1148a6180657800
121840531b54b85
13857b5139b24b
143a34930b7dc1
151b30ad4343b8
hexdbe18264a95

15110100109973 has 6 divisors (see below), whose sum is σ = 16608622435062. Its totient is φ = 13736454645320.

The previous prime is 15110100109967. The next prime is 15110100109991. The reversal of 15110100109973 is 37990100101151.

It can be written as a sum of positive squares in only one way, i.e., 14266922556964 + 843177553009 = 3777158^2 + 918247^2 .

It is not a de Polignac number, because 15110100109973 - 28 = 15110100109717 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 62438430086 + ... + 62438430327.

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

Almost surely, 215110100109973 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 8505, while the sum is 38.

The spelling of 15110100109973 in words is "fifteen trillion, one hundred ten billion, one hundred million, one hundred nine thousand, nine hundred seventy-three".

Divisors: 1 11 121 124876860413 1373645464543 15110100109973