Base | Representation |
---|---|
bin | 110001110111011001… |
… | …1001100001111100000 |
3 | 101020101222110201121210 |
4 | 1203232303030033200 |
5 | 3223302404041000 |
6 | 121110000150120 |
7 | 10510452453303 |
oct | 1435663141740 |
9 | 336358421553 |
10 | 107085612000 |
11 | 41462044294 |
12 | 18906908340 |
13 | a13778c273 |
14 | 527c104b3a |
15 | 2bbb315350 |
hex | 18eeccc3e0 |
107085612000 has 96 divisors (see below), whose sum is σ = 350812504224. Its totient is φ = 28556160000.
The previous prime is 107085611987. The next prime is 107085612037. The reversal of 107085612000 is 216580701.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1070856120002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4449901 + ... + 4473900.
It is an arithmetic number, because the mean of its divisors is an integer number (3654296919).
Almost surely, 2107085612000 is an apocalyptic number.
107085612000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107085612000 is an abundant number, since it is smaller than the sum of its proper divisors (243726892224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107085612000 is an equidigital number, since it uses as much as digits as its factorization.
107085612000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8923829 (or 8923811 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 30.
The spelling of 107085612000 in words is "one hundred seven billion, eighty-five million, six hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •