Base | Representation |
---|---|
bin | 111100111000110101… |
… | …1100000100100000001 |
3 | 110111111121221201101210 |
4 | 1321301223200210001 |
5 | 4120242044443412 |
6 | 140022452120333 |
7 | 12306155533302 |
oct | 1716153404401 |
9 | 414447851353 |
10 | 130756249857 |
11 | 504a9548912 |
12 | 214120060a9 |
13 | c43a779c5c |
14 | 6485ac67a9 |
15 | 360444783c |
hex | 1e71ae0901 |
130756249857 has 4 divisors (see below), whose sum is σ = 174341666480. Its totient is φ = 87170833236.
The previous prime is 130756249831. The next prime is 130756249859. The reversal of 130756249857 is 758942657031.
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.
It is not a de Polignac number, because 130756249857 - 212 = 130756245761 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130756249797 and 130756249806.
It is not an unprimeable number, because it can be changed into a prime (130756249859) 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, 21792708307 + ... + 21792708312.
It is an arithmetic number, because the mean of its divisors is an integer number (43585416620).
It is a 1-persistent number, because it is pandigital, but 2⋅130756249857 = 261512499714 is not.
Almost surely, 2130756249857 is an apocalyptic number.
It is an amenable number.
130756249857 is a deficient number, since it is larger than the sum of its proper divisors (43585416623).
130756249857 is an equidigital number, since it uses as much as digits as its factorization.
130756249857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43585416622.
The product of its (nonzero) digits is 12700800, while the sum is 57.
The spelling of 130756249857 in words is "one hundred thirty billion, seven hundred fifty-six million, two hundred forty-nine thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •