Base | Representation |
---|---|
bin | 110001110101010010… |
… | …0001010110100000111 |
3 | 101020020000210011122010 |
4 | 1203222210022310013 |
5 | 3223131212041002 |
6 | 121054541305303 |
7 | 10505630536461 |
oct | 1435244126407 |
9 | 336200704563 |
10 | 107014565127 |
11 | 41425a28768 |
12 | 188a6b65233 |
13 | a125b450b2 |
14 | 52728cd131 |
15 | 2bb4e7e46c |
hex | 18ea90ad07 |
107014565127 has 32 divisors (see below), whose sum is σ = 153479531520. Its totient is φ = 66112156800.
The previous prime is 107014565101. The next prime is 107014565129. The reversal of 107014565127 is 721565410701.
It is not a de Polignac number, because 107014565127 - 27 = 107014564999 is a prime.
It is a super-2 number, since 2×1070145651272 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107014565129) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 5082273 + ... + 5103285.
It is an arithmetic number, because the mean of its divisors is an integer number (4796235360).
Almost surely, 2107014565127 is an apocalyptic number.
107014565127 is a deficient number, since it is larger than the sum of its proper divisors (46464966393).
107014565127 is a wasteful number, since it uses less digits than its factorization.
107014565127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22983.
The product of its (nonzero) digits is 58800, while the sum is 39.
Adding to 107014565127 its reverse (721565410701), we get a palindrome (828579975828).
The spelling of 107014565127 in words is "one hundred seven billion, fourteen million, five hundred sixty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •