Base | Representation |
---|---|
bin | 110010000111001011… |
… | …0011001011110110100 |
3 | 101021202212111010020000 |
4 | 1210032112121132310 |
5 | 3230343410404324 |
6 | 121234305311300 |
7 | 10526540566035 |
oct | 1441626313664 |
9 | 337685433200 |
10 | 107614934964 |
11 | 41703909489 |
12 | 18a34035530 |
13 | a1c0340114 |
14 | 52cc530a8c |
15 | 2beca219c9 |
hex | 190e5997b4 |
107614934964 has 60 divisors (see below), whose sum is σ = 297875341764. Its totient is φ = 33761546496.
The previous prime is 107614934957. The next prime is 107614935013. The reversal of 107614934964 is 469439416701.
107614934964 is a `hidden beast` number, since 1 + 0 + 7 + 6 + 149 + 3 + 496 + 4 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 75538124964 + 32076810000 = 274842^2 + 179100^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 107614934964.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 9763459 + ... + 9774474.
Almost surely, 2107614934964 is an apocalyptic number.
It is an amenable number.
107614934964 is an abundant number, since it is smaller than the sum of its proper divisors (190260406800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107614934964 is a wasteful number, since it uses less digits than its factorization.
107614934964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19537966 (or 19537955 counting only the distinct ones).
The product of its (nonzero) digits is 3919104, while the sum is 54.
The spelling of 107614934964 in words is "one hundred seven billion, six hundred fourteen million, nine hundred thirty-four thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •