Base | Representation |
---|---|
bin | 110010001001110000… |
… | …0001110001011100111 |
3 | 101021222220011210201222 |
4 | 1210103200032023213 |
5 | 3231033024134244 |
6 | 121251034410555 |
7 | 10531640522435 |
oct | 1442340161347 |
9 | 337886153658 |
10 | 107701396199 |
11 | 417486a3051 |
12 | 18a58b90a5b |
13 | a205223407 |
14 | 52d9bd9d55 |
15 | 2c053eebee |
hex | 191380e2e7 |
107701396199 has 12 divisors (see below), whose sum is σ = 116285025288. Its totient is φ = 99704265600.
The previous prime is 107701396193. The next prime is 107701396207. The reversal of 107701396199 is 991693107701.
It is a de Polignac number, because none of the positive numbers 2k-107701396199 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107701396199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107701396193) 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 11 ways as a sum of consecutive naturals, for example, 3037037 + ... + 3072294.
It is an arithmetic number, because the mean of its divisors is an integer number (9690418774).
Almost surely, 2107701396199 is an apocalyptic number.
107701396199 is a deficient number, since it is larger than the sum of its proper divisors (8583629089).
107701396199 is an equidigital number, since it uses as much as digits as its factorization.
107701396199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6109426 (or 6109409 counting only the distinct ones).
The product of its (nonzero) digits is 642978, while the sum is 53.
The spelling of 107701396199 in words is "one hundred seven billion, seven hundred one million, three hundred ninety-six thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •