Base | Representation |
---|---|
bin | 11000011100111100110011… |
… | …001000110011101101011001 |
3 | 112002202222002210122222102211 |
4 | 120130330303020303231121 |
5 | 103043434112240242023 |
6 | 1020420210202355121 |
7 | 31436456332005055 |
oct | 3034746310635531 |
9 | 462688083588384 |
10 | 107542544071513 |
11 | 312a259a5555a1 |
12 | 1008a5704bbaa1 |
13 | 48012aba61b45 |
14 | 1c7b13067cc65 |
15 | c67665b1ca0d |
hex | 61cf33233b59 |
107542544071513 has 4 divisors (see below), whose sum is σ = 110165532951348. Its totient is φ = 104919555191680.
The previous prime is 107542544071511. The next prime is 107542544071597. The reversal of 107542544071513 is 315170445245701.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 64860521281609 + 42682022789904 = 8053603^2 + 6533148^2 .
It is a cyclic number.
It is not a de Polignac number, because 107542544071513 - 21 = 107542544071511 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107542544071511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1311494439856 + ... + 1311494439937.
It is an arithmetic number, because the mean of its divisors is an integer number (27541383237837).
Almost surely, 2107542544071513 is an apocalyptic number.
It is an amenable number.
107542544071513 is a deficient number, since it is larger than the sum of its proper divisors (2622988879835).
107542544071513 is an equidigital number, since it uses as much as digits as its factorization.
107542544071513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622988879834.
The product of its (nonzero) digits is 2352000, while the sum is 49.
The spelling of 107542544071513 in words is "one hundred seven trillion, five hundred forty-two billion, five hundred forty-four million, seventy-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •