Base | Representation |
---|---|
bin | 110001110100110111… |
… | …1000011111001011100 |
3 | 101020012001120212021212 |
4 | 1203221233003321130 |
5 | 3223114131040124 |
6 | 121053323043552 |
7 | 10505401313612 |
oct | 1435157037134 |
9 | 336161525255 |
10 | 107000643164 |
11 | 41419089a08 |
12 | 188a23705b8 |
13 | a122cac34c |
14 | 5270b076b2 |
15 | 2bb3b2e40e |
hex | 18e9bc3e5c |
107000643164 has 6 divisors (see below), whose sum is σ = 187251125544. Its totient is φ = 53500321580.
The previous prime is 107000643161. The next prime is 107000643187. The reversal of 107000643164 is 461346000701.
107000643164 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1070006431642 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107000643164.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107000643161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13375080392 + ... + 13375080399.
It is an arithmetic number, because the mean of its divisors is an integer number (31208520924).
Almost surely, 2107000643164 is an apocalyptic number.
It is an amenable number.
107000643164 is a deficient number, since it is larger than the sum of its proper divisors (80250482380).
107000643164 is a wasteful number, since it uses less digits than its factorization.
107000643164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26750160795 (or 26750160793 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 107000643164 its reverse (461346000701), we get a palindrome (568346643865).
The spelling of 107000643164 in words is "one hundred seven billion, six hundred forty-three thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •