Base | Representation |
---|---|
bin | 111100111001001010… |
… | …1100101100100010101 |
3 | 110111112101201010110121 |
4 | 1321302111211210111 |
5 | 4120302410433110 |
6 | 140023524351541 |
7 | 12306351354316 |
oct | 1716225454425 |
9 | 414471633417 |
10 | 130767280405 |
11 | 505047a2273 |
12 | 214158455b1 |
13 | c43cb3c8c8 |
14 | 648735860d |
15 | 36053c5cda |
hex | 1e72565915 |
130767280405 has 8 divisors (see below), whose sum is σ = 166151368152. Its totient is φ = 98460069888.
The previous prime is 130767280403. The next prime is 130767280433. The reversal of 130767280405 is 504082767031.
It can be written as a sum of positive squares in 4 ways, for example, as 12162119524 + 118605160881 = 110282^2 + 344391^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130767280405 - 21 = 130767280403 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130767280403) by changing a digit.
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, 769219212 + ... + 769219381.
It is an arithmetic number, because the mean of its divisors is an integer number (20768921019).
Almost surely, 2130767280405 is an apocalyptic number.
It is an amenable number.
130767280405 is a deficient number, since it is larger than the sum of its proper divisors (35384087747).
130767280405 is a wasteful number, since it uses less digits than its factorization.
130767280405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1538438615.
The product of its (nonzero) digits is 282240, while the sum is 43.
The spelling of 130767280405 in words is "one hundred thirty billion, seven hundred sixty-seven million, two hundred eighty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •