Base | Representation |
---|---|
bin | 11000111101010010… |
… | …01100011001011111 |
3 | 1021120210121120221221 |
4 | 30132221030121133 |
5 | 204420122021210 |
6 | 10053323234211 |
7 | 653016523444 |
oct | 143651143137 |
9 | 37523546857 |
10 | 13399017055 |
11 | 5756439916 |
12 | 271b378967 |
13 | 1356c5aa78 |
14 | 9117559cb |
15 | 5364be1da |
hex | 31ea4c65f |
13399017055 has 8 divisors (see below), whose sum is σ = 16160440032. Its totient is φ = 10664800608.
The previous prime is 13399017029. The next prime is 13399017083. The reversal of 13399017055 is 55071099331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13399017055 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 6800547 + ... + 6802516.
It is an arithmetic number, because the mean of its divisors is an integer number (2020055004).
Almost surely, 213399017055 is an apocalyptic number.
13399017055 is a deficient number, since it is larger than the sum of its proper divisors (2761422977).
13399017055 is a wasteful number, since it uses less digits than its factorization.
13399017055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13603265.
The product of its (nonzero) digits is 127575, while the sum is 43.
The spelling of 13399017055 in words is "thirteen billion, three hundred ninety-nine million, seventeen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •