Base | Representation |
---|---|
bin | 11000100000110011001000… |
… | …101111100100000110100001 |
3 | 112010201020211110200001011110 |
4 | 120200303020233210012201 |
5 | 103112302313020311231 |
6 | 1021141512415133533 |
7 | 31464542061110016 |
oct | 3040631057440641 |
9 | 463636743601143 |
10 | 107807047041441 |
11 | 31394791592800 |
12 | 10111889b142a9 |
13 | 48202126b4737 |
14 | 1c89c6329370d |
15 | c6e496cbd046 |
hex | 620cc8be41a1 |
107807047041441 has 96 divisors (see below), whose sum is σ = 165973686367104. Its totient is φ = 62129457561600.
The previous prime is 107807047041439. The next prime is 107807047041451. The reversal of 107807047041441 is 144140740708701.
It is not a de Polignac number, because 107807047041441 - 21 = 107807047041439 is a prime.
It is not an unprimeable number, because it can be changed into a prime (107807047041451) 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 95 ways as a sum of consecutive naturals, for example, 182649006 + ... + 183238296.
It is an arithmetic number, because the mean of its divisors is an integer number (1728892566324).
Almost surely, 2107807047041441 is an apocalyptic number.
107807047041441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
107807047041441 is a deficient number, since it is larger than the sum of its proper divisors (58166639325663).
107807047041441 is a wasteful number, since it uses less digits than its factorization.
107807047041441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589663 (or 589652 counting only the distinct ones).
The product of its (nonzero) digits is 702464, while the sum is 48.
The spelling of 107807047041441 in words is "one hundred seven trillion, eight hundred seven billion, forty-seven million, forty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •