Search a number
-
+
15046264051 = 713165343561
BaseRepresentation
bin11100000001101001…
…11100010011110011
31102211121012102000221
432000310330103303
5221303320422201
610525005353511
71041601064020
oct160064742363
942747172027
1015046264051
116421250975
122abab68897
13155a2c6b30
14a2a428547
155d0e024a1
hex380d3c4f3

15046264051 has 8 divisors (see below), whose sum is σ = 18518478944. Its totient is φ = 11904736320.

The previous prime is 15046264049. The next prime is 15046264061.

15046264051 is nontrivially palindromic in base 10.

15046264051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 15046264051 - 21 = 15046264049 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 15046263998 and 15046264016.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82671690 + ... + 82671871.

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

Almost surely, 215046264051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 165343581.

The product of its (nonzero) digits is 28800, while the sum is 34.

The spelling of 15046264051 in words is "fifteen billion, forty-six million, two hundred sixty-four thousand, fifty-one".

Divisors: 1 7 13 91 165343561 1157404927 2149466293 15046264051