Base | Representation |
---|---|
bin | 110010000100010000… |
… | …0110001100000101001 |
3 | 101021112001012002002101 |
4 | 1210020200301200221 |
5 | 3230143322212104 |
6 | 121220450133401 |
7 | 10524241230463 |
oct | 1441040614051 |
9 | 337461162071 |
10 | 107516991529 |
11 | 416635a20a2 |
12 | 18a07281261 |
13 | a1a5c6971c |
14 | 52bd517133 |
15 | 2be41265a4 |
hex | 1908831829 |
107516991529 has 4 divisors (see below), whose sum is σ = 107549003520. Its totient is φ = 107484979540.
The previous prime is 107516991481. The next prime is 107516991661. The reversal of 107516991529 is 925199615701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 925199615701 = 182713 ⋅5063677.
It is a cyclic number.
It is not a de Polignac number, because 107516991529 - 213 = 107516983337 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 107516991529.
It is not an unprimeable number, because it can be changed into a prime (107516998529) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16000957 + ... + 16007674.
It is an arithmetic number, because the mean of its divisors is an integer number (26887250880).
Almost surely, 2107516991529 is an apocalyptic number.
It is an amenable number.
107516991529 is a deficient number, since it is larger than the sum of its proper divisors (32011991).
107516991529 is an equidigital number, since it uses as much as digits as its factorization.
107516991529 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32011990.
The product of its (nonzero) digits is 1530900, while the sum is 55.
The spelling of 107516991529 in words is "one hundred seven billion, five hundred sixteen million, nine hundred ninety-one thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •