Base | Representation |
---|---|
bin | 1011110101110111011111… |
… | …0001011110110011010101 |
3 | 1201002201001001011001122101 |
4 | 2331131313301132303111 |
5 | 3201310033131142401 |
6 | 43405155244002101 |
7 | 2512445052210244 |
oct | 275356761366325 |
9 | 51081031131571 |
10 | 13020055334101 |
11 | 416a857893082 |
12 | 156345a230331 |
13 | 735a2a96830a |
14 | 3302617d295b |
15 | 178a351d3101 |
hex | bd777c5ecd5 |
13020055334101 has 16 divisors (see below), whose sum is σ = 13463398453248. Its totient is φ = 12578174784000.
The previous prime is 13020055334093. The next prime is 13020055334129. The reversal of 13020055334101 is 10143355002031.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13020055334101 - 23 = 13020055334093 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 13020055334101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13020055334131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 277583751 + ... + 277630651.
It is an arithmetic number, because the mean of its divisors is an integer number (841462403328).
Almost surely, 213020055334101 is an apocalyptic number.
It is an amenable number.
13020055334101 is a deficient number, since it is larger than the sum of its proper divisors (443343119147).
13020055334101 is a wasteful number, since it uses less digits than its factorization.
13020055334101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62292.
The product of its (nonzero) digits is 5400, while the sum is 28.
The spelling of 13020055334101 in words is "thirteen trillion, twenty billion, fifty-five million, three hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •