Base | Representation |
---|---|
bin | 111100110000001010… |
… | …0111101110000111111 |
3 | 110110202100011011120210 |
4 | 1321200110331300333 |
5 | 4114143033034422 |
6 | 135533532243503 |
7 | 12266022200112 |
oct | 1714024756077 |
9 | 413670134523 |
10 | 130465127487 |
11 | 5036a188312 |
12 | 21350610593 |
13 | c3c2369bb6 |
14 | 6459184579 |
15 | 35d8ade10c |
hex | 1e6053dc3f |
130465127487 has 8 divisors (see below), whose sum is σ = 177235645104. Its totient is φ = 85335680768.
The previous prime is 130465127477. The next prime is 130465127543. The reversal of 130465127487 is 784721564031.
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 130465127487 - 26 = 130465127423 is a prime.
It is a super-2 number, since 2×1304651274872 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130465127417) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 410267538 + ... + 410267855.
It is an arithmetic number, because the mean of its divisors is an integer number (22154455638).
Almost surely, 2130465127487 is an apocalyptic number.
130465127487 is a deficient number, since it is larger than the sum of its proper divisors (46770517617).
130465127487 is an equidigital number, since it uses as much as digits as its factorization.
130465127487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820535449.
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 130465127487 in words is "one hundred thirty billion, four hundred sixty-five million, one hundred twenty-seven thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •