Search a number
-
+
15130275391 = 711474180789
BaseRepresentation
bin11100001011101010…
…11010111000111111
31110001110021121221001
432011311122320333
5221441322303031
610541210151131
71043641135030
oct160565327077
943043247831
1015130275391
116464711930
122b231224a7
13157182cc9a
14a37656a87
155d8499861
hex385d5ae3f

15130275391 has 16 divisors (see below), whose sum is σ = 19265080320. Its totient is φ = 11538974880.

The previous prime is 15130275373. The next prime is 15130275427. The reversal of 15130275391 is 19357203151.

It is a cyclic number.

It is not a de Polignac number, because 15130275391 - 25 = 15130275359 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 15130275391.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2086776 + ... + 2094013.

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

Almost surely, 215130275391 is an apocalyptic number.

15130275391 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 4180854.

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

It can be divided in two parts, 15130 and 275391, that added together give a square (290521 = 5392).

The spelling of 15130275391 in words is "fifteen billion, one hundred thirty million, two hundred seventy-five thousand, three hundred ninety-one".

Divisors: 1 7 11 47 77 329 517 3619 4180789 29265523 45988679 196497083 321920753 1375479581 2161467913 15130275391