[go: up one dir, main page]

Search a number
-
+
13915053 = 321546117
BaseRepresentation
bin110101000101…
…001110101101
3222011221212100
4311011032231
512030240203
61214125313
7226163445
oct65051655
928157770
1013915053
117944649
1247b0839
132b62879
141bc3125
15134cea3
hexd453ad

13915053 has 6 divisors (see below), whose sum is σ = 20099534. Its totient is φ = 9276696.

The previous prime is 13915043. The next prime is 13915081. The reversal of 13915053 is 35051931.

It can be written as a sum of positive squares in only one way, i.e., 10771524 + 3143529 = 3282^2 + 1773^2 .

It is not a de Polignac number, because 13915053 - 25 = 13915021 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 773050 + ... + 773067.

Almost surely, 213915053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1546123 (or 1546120 counting only the distinct ones).

The product of its (nonzero) digits is 2025, while the sum is 27.

The square root of 13915053 is about 3730.2885947337. The cubic root of 13915053 is about 240.5257744142.

Adding to 13915053 its reverse (35051931), we get a palindrome (48966984).

The spelling of 13915053 in words is "thirteen million, nine hundred fifteen thousand, fifty-three".

Divisors: 1 3 9 1546117 4638351 13915053