Base | Representation |
---|---|
bin | 1011111010111100101101… |
… | …0000101000000010011101 |
3 | 1201102001101010112112022202 |
4 | 2332233023100220002131 |
5 | 3204222330432300440 |
6 | 43513234054221245 |
7 | 2521655325140426 |
oct | 276571320500235 |
9 | 51361333475282 |
10 | 13107355353245 |
11 | 41a388643062a |
12 | 1578362954825 |
13 | 7410312ac78a |
14 | 334583ca464d |
15 | 17ae444d0615 |
hex | bebcb42809d |
13107355353245 has 16 divisors (see below), whose sum is σ = 16348555520640. Its totient is φ = 10079560522944.
The previous prime is 13107355353241. The next prime is 13107355353259. The reversal of 13107355353245 is 54235355370131.
13107355353245 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 13107355353245 - 22 = 13107355353241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13107355353245.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13107355353241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 426795305 + ... + 426826014.
It is an arithmetic number, because the mean of its divisors is an integer number (1021784720040).
Almost surely, 213107355353245 is an apocalyptic number.
It is an amenable number.
13107355353245 is a deficient number, since it is larger than the sum of its proper divisors (3241200167395).
13107355353245 is an equidigital number, since it uses as much as digits as its factorization.
13107355353245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 853621444.
The product of its (nonzero) digits is 2835000, while the sum is 47.
The spelling of 13107355353245 in words is "thirteen trillion, one hundred seven billion, three hundred fifty-five million, three hundred fifty-three thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •