Base | Representation |
---|---|
bin | 111100110001011110… |
… | …1100010001100100110 |
3 | 110110212102022020001210 |
4 | 1321202331202030212 |
5 | 4114240341120102 |
6 | 135542151332250 |
7 | 12300066614166 |
oct | 1714275421446 |
9 | 413772266053 |
10 | 130509316902 |
11 | 5039211a498 |
12 | 21363381086 |
13 | c3cb56c593 |
14 | 6460da85a6 |
15 | 35dc91c36c |
hex | 1e62f62326 |
130509316902 has 8 divisors (see below), whose sum is σ = 261018633816. Its totient is φ = 43503105632.
The previous prime is 130509316901. The next prime is 130509316909. The reversal of 130509316902 is 209613905031.
It is a sphenic number, since it is the product of 3 distinct primes.
130509316902 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130509316901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10875776403 + ... + 10875776414.
It is an arithmetic number, because the mean of its divisors is an integer number (32627329227).
Almost surely, 2130509316902 is an apocalyptic number.
130509316902 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130509316902 is a wasteful number, since it uses less digits than its factorization.
130509316902 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21751552822.
The product of its (nonzero) digits is 43740, while the sum is 39.
The spelling of 130509316902 in words is "one hundred thirty billion, five hundred nine million, three hundred sixteen thousand, nine hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •