Base | Representation |
---|---|
bin | 1111100111011… |
… | …10010101111111 |
3 | 100010111110202222 |
4 | 13303232111333 |
5 | 232013442204 |
6 | 20555435555 |
7 | 3150323156 |
oct | 763562577 |
9 | 303443688 |
10 | 130999679 |
11 | 67a44aa8 |
12 | 37a55bbb |
13 | 211a8805 |
14 | 1358059d |
15 | b779abe |
hex | 7cee57f |
130999679 has 4 divisors (see below), whose sum is σ = 131571960. Its totient is φ = 130427400.
The previous prime is 130999667. The next prime is 130999691. The reversal of 130999679 is 976999031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 976999031 = 821 ⋅1190011.
It is an interprime number because it is at equal distance from previous prime (130999667) and next prime (130999691).
It is a cyclic number.
It is not a de Polignac number, because 130999679 - 28 = 130999423 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 130999679.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130999619) 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, 285797 + ... + 286254.
It is an arithmetic number, because the mean of its divisors is an integer number (32892990).
Almost surely, 2130999679 is an apocalyptic number.
130999679 is a deficient number, since it is larger than the sum of its proper divisors (572281).
130999679 is an equidigital number, since it uses as much as digits as its factorization.
130999679 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 572280.
The product of its (nonzero) digits is 826686, while the sum is 53.
The square root of 130999679 is about 11445.5091193009. The cubic root of 130999679 is about 507.8748929835.
The spelling of 130999679 in words is "one hundred thirty million, nine hundred ninety-nine thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •