Base | Representation |
---|---|
bin | 111100110100010110… |
… | …0011101111110011101 |
3 | 110111010010022011100001 |
4 | 1321220230131332131 |
5 | 4114440002201321 |
6 | 135555505134301 |
7 | 12302345326213 |
oct | 1715054357635 |
9 | 414103264301 |
10 | 130605506461 |
11 | 504314490a1 |
12 | 2138b62a391 |
13 | c41547a891 |
14 | 646da86cb3 |
15 | 35e60bcc91 |
hex | 1e68b1df9d |
130605506461 has 16 divisors (see below), whose sum is σ = 138723517440. Its totient is φ = 122797434240.
The previous prime is 130605506459. The next prime is 130605506483. The reversal of 130605506461 is 164605506031.
It is a cyclic number.
It is not a de Polignac number, because 130605506461 - 21 = 130605506459 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
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 130605506461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130605506411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 337960 + ... + 612721.
It is an arithmetic number, because the mean of its divisors is an integer number (8670219840).
Almost surely, 2130605506461 is an apocalyptic number.
It is an amenable number.
130605506461 is a deficient number, since it is larger than the sum of its proper divisors (8118010979).
130605506461 is an equidigital number, since it uses as much as digits as its factorization.
130605506461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950844.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 130605506461 in words is "one hundred thirty billion, six hundred five million, five hundred six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •