Base | Representation |
---|---|
bin | 111100111110100100… |
… | …1000100011101111111 |
3 | 110112000000210111111222 |
4 | 1321331021010131333 |
5 | 4121140312022404 |
6 | 140053521503555 |
7 | 12314012203550 |
oct | 1717511043577 |
9 | 415000714458 |
10 | 130948548479 |
11 | 505980506a1 |
12 | 214664a1bbb |
13 | c46b568a18 |
14 | 64a3462327 |
15 | 361627edbe |
hex | 1e7d24477f |
130948548479 has 8 divisors (see below), whose sum is σ = 149660649600. Its totient is φ = 112237738776.
The previous prime is 130948548469. The next prime is 130948548487. The reversal of 130948548479 is 974845849031.
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 130948548479 - 216 = 130948482943 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130948548439) 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 7 ways as a sum of consecutive naturals, for example, 94829 + ... + 520470.
It is an arithmetic number, because the mean of its divisors is an integer number (18707581200).
Almost surely, 2130948548479 is an apocalyptic number.
130948548479 is a deficient number, since it is larger than the sum of its proper divisors (18712101121).
130948548479 is an equidigital number, since it uses as much as digits as its factorization.
130948548479 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645709.
The product of its (nonzero) digits is 34836480, while the sum is 62.
The spelling of 130948548479 in words is "one hundred thirty billion, nine hundred forty-eight million, five hundred forty-eight thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •