Base | Representation |
---|---|
bin | 11000010110001000110101… |
… | …101000010001111000000100 |
3 | 112001010012211102210212121022 |
4 | 120112020311220101320010 |
5 | 103013301420204100313 |
6 | 1015421152140410312 |
7 | 31360605205542620 |
oct | 3026106550217004 |
9 | 461105742725538 |
10 | 107074434440708 |
11 | 311320158a9519 |
12 | 100138ab546998 |
13 | 47990ca81a217 |
14 | 1c62604982180 |
15 | c5a3b9a6cc08 |
hex | 616235a11e04 |
107074434440708 has 12 divisors (see below), whose sum is σ = 214148868881472. Its totient is φ = 45889043331720.
The previous prime is 107074434440693. The next prime is 107074434440711. The reversal of 107074434440708 is 807044434470701.
It is a happy number.
107074434440708 is an admirable number.
It is a super-2 number, since 2×1070744344407082 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107074434440708.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1912043472128 + ... + 1912043472183.
It is an arithmetic number, because the mean of its divisors is an integer number (17845739073456).
Almost surely, 2107074434440708 is an apocalyptic number.
It is an amenable number.
107074434440708 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107074434440708 is a wasteful number, since it uses less digits than its factorization.
107074434440708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3824086944322 (or 3824086944320 counting only the distinct ones).
The product of its (nonzero) digits is 8429568, while the sum is 53.
The spelling of 107074434440708 in words is "one hundred seven trillion, seventy-four billion, four hundred thirty-four million, four hundred forty thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •