Search a number
-
+
15107227147 = 137110271731
BaseRepresentation
bin11100001000111010…
…11111111000001011
31102222211220122200101
432010131133320023
5221414422232042
610535024150231
71043241212005
oct160435377013
942884818611
1015107227147
1164526aa3a1
122b17468377
131569b2027c
14a34577375
155d64456b7
hex38475fe0b

15107227147 has 4 divisors (see below), whose sum is σ = 15217499016. Its totient is φ = 14996955280.

The previous prime is 15107227139. The next prime is 15107227153. The reversal of 15107227147 is 74172270151.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 15107227147 - 23 = 15107227139 is a prime.

It is a Duffinian number.

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

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 3 ways as a sum of consecutive naturals, for example, 55135729 + ... + 55136002.

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

Almost surely, 215107227147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 110271868.

The product of its (nonzero) digits is 27440, while the sum is 37.

Adding to 15107227147 its reverse (74172270151), we get a palindrome (89279497298).

The spelling of 15107227147 in words is "fifteen billion, one hundred seven million, two hundred twenty-seven thousand, one hundred forty-seven".

Divisors: 1 137 110271731 15107227147