Base | Representation |
---|---|
bin | 111100110100011000… |
… | …0000111000011010000 |
3 | 110111010012002122220101 |
4 | 1321220300013003100 |
5 | 4114440223224021 |
6 | 135555541422144 |
7 | 12302356413424 |
oct | 1715060070320 |
9 | 414105078811 |
10 | 130606461136 |
11 | 50431a40388 |
12 | 2138ba0a954 |
13 | c415723288 |
14 | 646dc54b84 |
15 | 35e620aa91 |
hex | 1e68c070d0 |
130606461136 has 40 divisors (see below), whose sum is σ = 268036895880. Its totient is φ = 61438562304.
The previous prime is 130606461113. The next prime is 130606461137. The reversal of 130606461136 is 631164606031.
It can be written as a sum of positive squares in 4 ways, for example, as 2974611600 + 127631849536 = 54540^2 + 357256^2 .
It is a junction number, because it is equal to n+sod(n) for n = 130606461095 and 130606461104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130606461137) 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, 638460 + ... + 817828.
It is an arithmetic number, because the mean of its divisors is an integer number (6700922397).
Almost surely, 2130606461136 is an apocalyptic number.
130606461136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
130606461136 is an abundant number, since it is smaller than the sum of its proper divisors (137430434744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130606461136 is a wasteful number, since it uses less digits than its factorization.
130606461136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182071 (or 182065 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 37.
The spelling of 130606461136 in words is "one hundred thirty billion, six hundred six million, four hundred sixty-one thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •