Base | Representation |
---|---|
bin | 110010001000111101… |
… | …1101010101111000100 |
3 | 101021221001120121011222 |
4 | 1210101323222233010 |
5 | 3231004302132422 |
6 | 121244253415512 |
7 | 10531200465353 |
oct | 1442173525704 |
9 | 337831517158 |
10 | 107675036612 |
11 | 41734829770 |
12 | 18a5019a598 |
13 | a1cc924420 |
14 | 52d64d799a |
15 | 2c02e44842 |
hex | 1911eeabc4 |
107675036612 has 24 divisors (see below), whose sum is σ = 221373852672. Its totient is φ = 45178336800.
The previous prime is 107675036597. The next prime is 107675036627. The reversal of 107675036612 is 216630576701.
It is an interprime number because it is at equal distance from previous prime (107675036597) and next prime (107675036627).
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (44).
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 7 ways as a sum of consecutive naturals, for example, 94120964 + ... + 94122107.
It is an arithmetic number, because the mean of its divisors is an integer number (9223910528).
Almost surely, 2107675036612 is an apocalyptic number.
It is an amenable number.
107675036612 is an abundant number, since it is smaller than the sum of its proper divisors (113698816060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107675036612 is a wasteful number, since it uses less digits than its factorization.
107675036612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188243099 (or 188243097 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 44.
The spelling of 107675036612 in words is "one hundred seven billion, six hundred seventy-five million, thirty-six thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •