Base | Representation |
---|---|
bin | 110010010010001110… |
… | …0110000001011010001 |
3 | 101022201201010220121020 |
4 | 1210210130300023101 |
5 | 3232123314341122 |
6 | 121335152150053 |
7 | 10541662205232 |
oct | 1444434601321 |
9 | 338651126536 |
10 | 107985699537 |
11 | 41884126391 |
12 | 18b18238329 |
13 | a24c0b6741 |
14 | 5325885089 |
15 | 2c2035cc5c |
hex | 19247302d1 |
107985699537 has 8 divisors (see below), whose sum is σ = 146697554304. Its totient is φ = 70632155568.
The previous prime is 107985699529. The next prime is 107985699571. The reversal of 107985699537 is 735996589701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107985699537 - 23 = 107985699529 is a prime.
It is a super-2 number, since 2×1079856995372 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107985699137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 339577513 + ... + 339577830.
It is an arithmetic number, because the mean of its divisors is an integer number (18337194288).
Almost surely, 2107985699537 is an apocalyptic number.
It is an amenable number.
107985699537 is a deficient number, since it is larger than the sum of its proper divisors (38711854767).
107985699537 is an equidigital number, since it uses as much as digits as its factorization.
107985699537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679155399.
The product of its (nonzero) digits is 128595600, while the sum is 69.
The spelling of 107985699537 in words is "one hundred seven billion, nine hundred eighty-five million, six hundred ninety-nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •