Base | Representation |
---|---|
bin | 110010001001100111… |
… | …0111011000110010000 |
3 | 101021222120122102102021 |
4 | 1210103032323012100 |
5 | 3231030344032314 |
6 | 121250353301224 |
7 | 10531554135124 |
oct | 1442316730620 |
9 | 337876572367 |
10 | 107696861584 |
11 | 41746086134 |
12 | 18a57564814 |
13 | a2042c6400 |
14 | 52d9379584 |
15 | 2c04d06324 |
hex | 19133bb190 |
107696861584 has 45 divisors (see below), whose sum is σ = 225984142209. Its totient is φ = 49698367680.
The previous prime is 107696861521. The next prime is 107696861651. The reversal of 107696861584 is 485168696701.
It is a happy number.
The square root of 107696861584 is 328172.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 15931488400 + 91765373184 = 126220^2 + 302928^2 .
It is a super-2 number, since 2×1076968615842 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 17061789 + ... + 17068099.
Almost surely, 2107696861584 is an apocalyptic number.
107696861584 is the 328172-nd square number.
It is an amenable number.
107696861584 is an abundant number, since it is smaller than the sum of its proper divisors (118287280625).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107696861584 is an frugal number, since it uses more digits than its factorization.
107696861584 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12656 (or 6326 counting only the distinct ones).
The product of its (nonzero) digits is 17418240, while the sum is 61.
The spelling of 107696861584 in words is "one hundred seven billion, six hundred ninety-six million, eight hundred sixty-one thousand, five hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •