Base | Representation |
---|---|
bin | 111100110001010010… |
… | …0000000011101100001 |
3 | 110110211221201020200001 |
4 | 1321202210000131201 |
5 | 4114232133000441 |
6 | 135541352100001 |
7 | 12266656003501 |
oct | 1714244003541 |
9 | 413757636601 |
10 | 130502625121 |
11 | 503893698a0 |
12 | 21361094601 |
13 | c3ca06874b |
14 | 6460145a01 |
15 | 35dc049731 |
hex | 1e62900761 |
130502625121 has 4 divisors (see below), whose sum is σ = 142366500144. Its totient is φ = 118638750100.
The previous prime is 130502625101. The next prime is 130502625139. The reversal of 130502625121 is 121526205031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130502625121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130502625121.
It is not an unprimeable number, because it can be changed into a prime (130502625101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5931937495 + ... + 5931937516.
It is an arithmetic number, because the mean of its divisors is an integer number (35591625036).
Almost surely, 2130502625121 is an apocalyptic number.
130502625121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130502625121 is a deficient number, since it is larger than the sum of its proper divisors (11863875023).
130502625121 is a wasteful number, since it uses less digits than its factorization.
130502625121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11863875022.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 130502625121 in words is "one hundred thirty billion, five hundred two million, six hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.970 sec. • engine limits •