Base | Representation |
---|---|
bin | 11001011010100011… |
… | …00101010011111101 |
3 | 1022012220111200220002 |
4 | 30231101211103331 |
5 | 210420442022020 |
6 | 10133532404045 |
7 | 662060134142 |
oct | 145521452375 |
9 | 38186450802 |
10 | 13644485885 |
11 | 5871a58218 |
12 | 2789616625 |
13 | 1395a74bb4 |
14 | 9361b23c9 |
15 | 54cd0a975 |
hex | 32d4654fd |
13644485885 has 8 divisors (see below), whose sum is σ = 16390788696. Its totient is φ = 10903984960.
The previous prime is 13644485879. The next prime is 13644485887. The reversal of 13644485885 is 58858444631.
It can be written as a sum of positive squares in 4 ways, for example, as 456719641 + 13187766244 = 21371^2 + 114838^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13644485885 - 28 = 13644485629 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 13644485885.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13644485887) 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 7 ways as a sum of consecutive naturals, for example, 1445294 + ... + 1454703.
It is an arithmetic number, because the mean of its divisors is an integer number (2048848587).
Almost surely, 213644485885 is an apocalyptic number.
It is an amenable number.
13644485885 is a deficient number, since it is larger than the sum of its proper divisors (2746302811).
13644485885 is an equidigital number, since it uses as much as digits as its factorization.
13644485885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2900943.
The product of its digits is 14745600, while the sum is 56.
The spelling of 13644485885 in words is "thirteen billion, six hundred forty-four million, four hundred eighty-five thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •