Base | Representation |
---|---|
bin | 110001111000010010… |
… | …0000111110011001100 |
3 | 101020111001011202210001 |
4 | 1203300210013303030 |
5 | 3223332443403301 |
6 | 121112534454044 |
7 | 10511262212461 |
oct | 1436044076314 |
9 | 336431152701 |
10 | 107115216076 |
11 | 41477824270 |
12 | 18914804324 |
13 | a140955c7b |
14 | 528200d668 |
15 | 2bbdc11c01 |
hex | 18f0907ccc |
107115216076 has 24 divisors (see below), whose sum is σ = 206956459584. Its totient is φ = 48102121680.
The previous prime is 107115216073. The next prime is 107115216079. The reversal of 107115216076 is 670612511701.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (107115216073) and next prime (107115216079).
It is a super-2 number, since 2×1071152160762 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107115216073) 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 7 ways as a sum of consecutive naturals, for example, 14661630 + ... + 14668933.
It is an arithmetic number, because the mean of its divisors is an integer number (8623185816).
Almost surely, 2107115216076 is an apocalyptic number.
It is an amenable number.
107115216076 is a deficient number, since it is larger than the sum of its proper divisors (99841243508).
107115216076 is a wasteful number, since it uses less digits than its factorization.
107115216076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29330661 (or 29330659 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 37.
Adding to 107115216076 its reverse (670612511701), we get a palindrome (777727727777).
The spelling of 107115216076 in words is "one hundred seven billion, one hundred fifteen million, two hundred sixteen thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •