Base | Representation |
---|---|
bin | 11001011100111100… |
… | …01011100101000100 |
3 | 1022021022021212001012 |
4 | 30232132023211010 |
5 | 210441112044242 |
6 | 10135531021352 |
7 | 662422614410 |
oct | 145636134504 |
9 | 38238255035 |
10 | 13664565572 |
11 | 58823223a9 |
12 | 279429a858 |
13 | 1399c85678 |
14 | 938b1bd40 |
15 | 54e975282 |
hex | 32e78b944 |
13664565572 has 24 divisors (see below), whose sum is σ = 27425716416. Its totient is φ = 5835545568.
The previous prime is 13664565511. The next prime is 13664565589. The reversal of 13664565572 is 27556546631.
It is a happy number.
13664565572 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13664565572.
It is an unprimeable number.
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, 854303 + ... + 870150.
It is an arithmetic number, because the mean of its divisors is an integer number (1142738184).
Almost surely, 213664565572 is an apocalyptic number.
It is an amenable number.
13664565572 is an abundant number, since it is smaller than the sum of its proper divisors (13761150844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13664565572 is a wasteful number, since it uses less digits than its factorization.
13664565572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1724747 (or 1724745 counting only the distinct ones).
The product of its digits is 4536000, while the sum is 50.
The spelling of 13664565572 in words is "thirteen billion, six hundred sixty-four million, five hundred sixty-five thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •