Base | Representation |
---|---|
bin | 11101101111000010110101… |
… | …000010010010101110111111 |
3 | 122011001002020100002020221122 |
4 | 131233002311002102232333 |
5 | 114120114130041140402 |
6 | 1142045431350021155 |
7 | 36355161120511331 |
oct | 3557026502225677 |
9 | 564032210066848 |
10 | 130776201505727 |
11 | 3873a96a46aa38 |
12 | 128013793477bb |
13 | 57c81b1bc8c8b |
14 | 244185d97d451 |
15 | 101bbc83eeca2 |
hex | 76f0b5092bbf |
130776201505727 has 4 divisors (see below), whose sum is σ = 138468919241376. Its totient is φ = 123083483770080.
The previous prime is 130776201505619. The next prime is 130776201505903. The reversal of 130776201505727 is 727505102677031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130776201505727 - 228 = 130775933070271 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 (130776201805727) 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, 3846358867799 + ... + 3846358867832.
It is an arithmetic number, because the mean of its divisors is an integer number (34617229810344).
Almost surely, 2130776201505727 is an apocalyptic number.
130776201505727 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
130776201505727 is a deficient number, since it is larger than the sum of its proper divisors (7692717735649).
130776201505727 is an equidigital number, since it uses as much as digits as its factorization.
130776201505727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7692717735648.
The product of its (nonzero) digits is 4321800, while the sum is 53.
The spelling of 130776201505727 in words is "one hundred thirty trillion, seven hundred seventy-six billion, two hundred one million, five hundred five thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •