Base | Representation |
---|---|
bin | 111100110000100101… |
… | …0011110101011111001 |
3 | 110110210022112220000220 |
4 | 1321201022132223321 |
5 | 4114210130442321 |
6 | 135535153050253 |
7 | 12266252345340 |
oct | 1714112365371 |
9 | 413708486026 |
10 | 130479155961 |
11 | 5037709a0a0 |
12 | 21355256989 |
13 | c3c523c27b |
14 | 645ad96b57 |
15 | 35d9e609c6 |
hex | 1e6129eaf9 |
130479155961 has 128 divisors (see below), whose sum is σ = 228007084032. Its totient is φ = 64399104000.
The previous prime is 130479155927. The next prime is 130479156001. The reversal of 130479155961 is 169551974031.
It is not a de Polignac number, because 130479155961 - 213 = 130479147769 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (130479156961) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 179475780 + ... + 179476506.
It is an arithmetic number, because the mean of its divisors is an integer number (1781305344).
Almost surely, 2130479155961 is an apocalyptic number.
130479155961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130479155961 is a deficient number, since it is larger than the sum of its proper divisors (97527928071).
130479155961 is a wasteful number, since it uses less digits than its factorization.
130479155961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203.
The product of its (nonzero) digits is 1020600, while the sum is 51.
The spelling of 130479155961 in words is "one hundred thirty billion, four hundred seventy-nine million, one hundred fifty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •