Base | Representation |
---|---|
bin | 110010001010111010… |
… | …1011110000001111000 |
3 | 101022002121210112021200 |
4 | 1210111311132001320 |
5 | 3231123033124233 |
6 | 121254553134200 |
7 | 10532624212602 |
oct | 1442565360170 |
9 | 338077715250 |
10 | 107740520568 |
11 | 4176879583a |
12 | 18a6a0ba360 |
13 | a210371525 |
14 | 53010a2172 |
15 | 2c08a7c313 |
hex | 1915d5e078 |
107740520568 has 48 divisors (see below), whose sum is σ = 292010968080. Its totient is φ = 35887202304.
The previous prime is 107740520561. The next prime is 107740520593. The reversal of 107740520568 is 865025047701.
107740520568 is a `hidden beast` number, since 1 + 0 + 7 + 74 + 0 + 520 + 56 + 8 = 666.
107740520568 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107740520561) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 448905 + ... + 645752.
It is an arithmetic number, because the mean of its divisors is an integer number (6083561835).
Almost surely, 2107740520568 is an apocalyptic number.
107740520568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
107740520568 is an abundant number, since it is smaller than the sum of its proper divisors (184270447512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107740520568 is a wasteful number, since it uses less digits than its factorization.
107740520568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1096036 (or 1096029 counting only the distinct ones).
The product of its (nonzero) digits is 470400, while the sum is 45.
The spelling of 107740520568 in words is "one hundred seven billion, seven hundred forty million, five hundred twenty thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •