Base | Representation |
---|---|
bin | 1100110010000… |
… | …00110001101100 |
3 | 21110202100021221 |
4 | 12121000301230 |
5 | 204422020301 |
6 | 14350033124 |
7 | 2441232655 |
oct | 631006154 |
9 | 243670257 |
10 | 107220076 |
11 | 55583037 |
12 | 2baa87a4 |
13 | 192a0c42 |
14 | 1035052c |
15 | 962dda1 |
hex | 6640c6c |
107220076 has 24 divisors (see below), whose sum is σ = 194987520. Its totient is φ = 51526272.
The previous prime is 107220073. The next prime is 107220079. The reversal of 107220076 is 670022701.
It is an interprime number because it is at equal distance from previous prime (107220073) and next prime (107220079).
It is a super-2 number, since 2×1072200762 = 22992289394891552, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107220076.
It is not an unprimeable number, because it can be changed into a prime (107220073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25045 + ... + 29011.
It is an arithmetic number, because the mean of its divisors is an integer number (8124480).
Almost surely, 2107220076 is an apocalyptic number.
It is an amenable number.
107220076 is a deficient number, since it is larger than the sum of its proper divisors (87767444).
107220076 is a wasteful number, since it uses less digits than its factorization.
107220076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4233 (or 4231 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 25.
The square root of 107220076 is about 10354.7127434806. The cubic root of 107220076 is about 475.0712004072.
Adding to 107220076 its reverse (670022701), we get a palindrome (777242777).
The spelling of 107220076 in words is "one hundred seven million, two hundred twenty thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •