Search a number
-
+
5015712083169 = 31671904027723
BaseRepresentation
bin100100011111100111110…
…1111001010110011100001
3122202111102121011122120110
41020333033233022303201
51124134134243130134
614400104125001533
71025242010156604
oct110771757126341
918674377148513
105015712083169
111664173791167
126900b39b32a9
132a4c972c04b8
14134a943ac33b
158a70bce37e9
hex48fcfbcace1

5015712083169 has 4 divisors (see below), whose sum is σ = 6687616110896. Its totient is φ = 3343808055444.

The previous prime is 5015712083153. The next prime is 5015712083171. The reversal of 5015712083169 is 9613802175105.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 5015712083169 - 24 = 5015712083153 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 835952013859 + ... + 835952013864.

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

Almost surely, 25015712083169 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1671904027726.

The product of its (nonzero) digits is 453600, while the sum is 48.

The spelling of 5015712083169 in words is "five trillion, fifteen billion, seven hundred twelve million, eighty-three thousand, one hundred sixty-nine".

Divisors: 1 3 1671904027723 5015712083169