Base | Representation |
---|---|
bin | 11000110100100100… |
… | …11011100001011011 |
3 | 1021101201002221012222 |
4 | 30122102123201123 |
5 | 204242420101302 |
6 | 10042153054255 |
7 | 651141425303 |
oct | 143222334133 |
9 | 37351087188 |
10 | 13325940827 |
11 | 5719167641 |
12 | 26ba9b738b |
13 | 1344a82cb4 |
14 | 905b72603 |
15 | 52ed86da2 |
hex | 31a49b85b |
13325940827 has 4 divisors (see below), whose sum is σ = 13650963816. Its totient is φ = 13000917840.
The previous prime is 13325940811. The next prime is 13325940857. The reversal of 13325940827 is 72804952331.
It is a happy number.
13325940827 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72804952331 = 205063 ⋅355037.
It is a cyclic number.
It is not a de Polignac number, because 13325940827 - 24 = 13325940811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13325940857) 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 3 ways as a sum of consecutive naturals, for example, 162511433 + ... + 162511514.
It is an arithmetic number, because the mean of its divisors is an integer number (3412740954).
Almost surely, 213325940827 is an apocalyptic number.
13325940827 is a deficient number, since it is larger than the sum of its proper divisors (325022989).
13325940827 is an equidigital number, since it uses as much as digits as its factorization.
13325940827 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325022988.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 13325940827 in words is "thirteen billion, three hundred twenty-five million, nine hundred forty thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •