Search a number
-
+
5015150050161 = 31671716683387
BaseRepresentation
bin100100011111010111000…
…1111001011101101110001
3122202102222102121102020010
41020332232033023231301
51124132011403101121
614355532250405133
71025222044030446
oct110765617135561
918672872542203
105015150050161
111663a05505479
1268bb777307a9
132a4c07a28ca4
14134a3d8a99cd
158a6c77c5376
hex48fae3cbb71

5015150050161 has 4 divisors (see below), whose sum is σ = 6686866733552. Its totient is φ = 3343433366772.

The previous prime is 5015150050159. The next prime is 5015150050237. The reversal of 5015150050161 is 1610500515105.

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 5015150050161 - 21 = 5015150050159 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (5015150050151) 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, 835858341691 + ... + 835858341696.

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

Almost surely, 25015150050161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1671716683390.

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

Adding to 5015150050161 its reverse (1610500515105), we get a palindrome (6625650565266).

The spelling of 5015150050161 in words is "five trillion, fifteen billion, one hundred fifty million, fifty thousand, one hundred sixty-one".

Divisors: 1 3 1671716683387 5015150050161