Base | Representation |
---|---|
bin | 110010000001100101… |
… | …0101011101111001101 |
3 | 101021021210110000112000 |
4 | 1210003022223233031 |
5 | 3230002343032022 |
6 | 121203524102513 |
7 | 10522102052016 |
oct | 1440312535715 |
9 | 337253400460 |
10 | 107427314637 |
11 | 41617a11565 |
12 | 189a1234a39 |
13 | a1904cb886 |
14 | 52b165200d |
15 | 2bdb3106ac |
hex | 19032abbcd |
107427314637 has 16 divisors (see below), whose sum is σ = 161849064000. Its totient is φ = 70404340752.
The previous prime is 107427314627. The next prime is 107427314693. The reversal of 107427314637 is 736413724701.
It is a happy number.
107427314637 is a `hidden beast` number, since 1 + 0 + 7 + 4 + 2 + 7 + 3 + 1 + 4 + 637 = 666.
It is not a de Polignac number, because 107427314637 - 26 = 107427314573 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 107427314592 and 107427314601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107427314627) by changing a digit.
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, 33716962 + ... + 33720147.
It is an arithmetic number, because the mean of its divisors is an integer number (10115566500).
Almost surely, 2107427314637 is an apocalyptic number.
It is an amenable number.
107427314637 is a deficient number, since it is larger than the sum of its proper divisors (54421749363).
107427314637 is an equidigital number, since it uses as much as digits as its factorization.
107427314637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67437177 (or 67437171 counting only the distinct ones).
The product of its (nonzero) digits is 592704, while the sum is 45.
The spelling of 107427314637 in words is "one hundred seven billion, four hundred twenty-seven million, three hundred fourteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •