Search a number
-
+
13366642447 = 56923491463
BaseRepresentation
bin11000111001011011…
…01100011100001111
31021111112200210100101
430130231230130033
5204333330024242
610050205311531
7652144405024
oct143455543417
937445623311
1013366642447
11573a137344
1227105655a7
131350333cb2
1490b32954b
155337269b7
hex31cb6c70f

13366642447 has 4 divisors (see below), whose sum is σ = 13390134480. Its totient is φ = 13343150416.

The previous prime is 13366642433. The next prime is 13366642451. The reversal of 13366642447 is 74424666331.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74424666331 = 256732898947.

It is a cyclic number.

It is not a de Polignac number, because 13366642447 - 27 = 13366642319 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 213366642447 is an apocalyptic number.

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

13366642447 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 23492032.

The product of its digits is 1741824, while the sum is 46.

The spelling of 13366642447 in words is "thirteen billion, three hundred sixty-six million, six hundred forty-two thousand, four hundred forty-seven".

Divisors: 1 569 23491463 13366642447