Base | Representation |
---|---|
bin | 11000010100011001… |
… | …01101001110111111 |
3 | 1020200220011202221210 |
4 | 30022030231032333 |
5 | 203214314130210 |
6 | 5555311255503 |
7 | 641353132452 |
oct | 141214551677 |
9 | 36626152853 |
10 | 13056005055 |
11 | 559a857925 |
12 | 264451a593 |
13 | 1300b804a2 |
14 | 8bbd87499 |
15 | 516315e20 |
hex | 30a32d3bf |
13056005055 has 32 divisors (see below), whose sum is σ = 21085272000. Its totient is φ = 6898230272.
The previous prime is 13056005051. The next prime is 13056005063. The reversal of 13056005055 is 55050065031.
It is a cyclic number.
It is not a de Polignac number, because 13056005055 - 22 = 13056005051 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13056005051) 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 31 ways as a sum of consecutive naturals, for example, 861907 + ... + 876923.
It is an arithmetic number, because the mean of its divisors is an integer number (658914750).
Almost surely, 213056005055 is an apocalyptic number.
13056005055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13056005055 is a deficient number, since it is larger than the sum of its proper divisors (8029266945).
13056005055 is a wasteful number, since it uses less digits than its factorization.
13056005055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15563.
The product of its (nonzero) digits is 11250, while the sum is 30.
The spelling of 13056005055 in words is "thirteen billion, fifty-six million, five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •