Base | Representation |
---|---|
bin | 11000010100010100… |
… | …00110111110010111 |
3 | 1020200211220011210120 |
4 | 30022022012332113 |
5 | 203214130332210 |
6 | 5555244523023 |
7 | 641344265154 |
oct | 141212067627 |
9 | 36624804716 |
10 | 13055324055 |
11 | 559a432214 |
12 | 2644250473 |
13 | 13009a2527 |
14 | 8bbc4b22b |
15 | 51622e270 |
hex | 30a286f97 |
13055324055 has 16 divisors (see below), whose sum is σ = 21796715520. Its totient is φ = 6660107168.
The previous prime is 13055324053. The next prime is 13055324077. The reversal of 13055324055 is 55042355031.
It is a happy number.
13055324055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13055324055 - 21 = 13055324053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13055324053) 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 15 ways as a sum of consecutive naturals, for example, 18920415 + ... + 18921104.
It is an arithmetic number, because the mean of its divisors is an integer number (1362294720).
Almost surely, 213055324055 is an apocalyptic number.
13055324055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13055324055 is a deficient number, since it is larger than the sum of its proper divisors (8741391465).
13055324055 is a wasteful number, since it uses less digits than its factorization.
13055324055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37841550.
The product of its (nonzero) digits is 45000, while the sum is 33.
Adding to 13055324055 its reverse (55042355031), we get a palindrome (68097679086).
The spelling of 13055324055 in words is "thirteen billion, fifty-five million, three hundred twenty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •