Base | Representation |
---|---|
bin | 11000011111110101011000… |
… | …001010000111010110110100 |
3 | 112010110220122222100120110121 |
4 | 120133311120022013112310 |
5 | 103110211010304313430 |
6 | 1021051224301301324 |
7 | 31460003550531046 |
oct | 3037653012072664 |
9 | 463426588316417 |
10 | 107740733666740 |
11 | 313696523a58a9 |
12 | 10100a61864844 |
13 | 4816ba4c8a095 |
14 | 1c86972139a96 |
15 | c6c8b5180a7a |
hex | 61fd582875b4 |
107740733666740 has 48 divisors (see below), whose sum is σ = 229863704994000. Its totient is φ = 42414331180032.
The previous prime is 107740733666737. The next prime is 107740733666767. The reversal of 107740733666740 is 47666337047701.
It can be written as a sum of positive squares in 8 ways, for example, as 15454239091344 + 92286494575396 = 3931188^2 + 9606586^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 165522009 + ... + 166171648.
It is an arithmetic number, because the mean of its divisors is an integer number (4788827187375).
Almost surely, 2107740733666740 is an apocalyptic number.
107740733666740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107740733666740 is an abundant number, since it is smaller than the sum of its proper divisors (122122971327260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107740733666740 is a wasteful number, since it uses less digits than its factorization.
107740733666740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 331693924 (or 331693922 counting only the distinct ones).
The product of its (nonzero) digits is 74680704, while the sum is 61.
The spelling of 107740733666740 in words is "one hundred seven trillion, seven hundred forty billion, seven hundred thirty-three million, six hundred sixty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •