Base | Representation |
---|---|
bin | 11101101011000011100011… |
… | …101100010110001110001011 |
3 | 122010001212202011201221101010 |
4 | 131223003203230112032023 |
5 | 114101121303213000201 |
6 | 1141315501240055003 |
7 | 36326315565366225 |
oct | 3553034354261613 |
9 | 563055664657333 |
10 | 130502106375051 |
11 | 386446a5958454 |
12 | 12778223464463 |
13 | 57a83acc13718 |
14 | 243249b04b415 |
15 | 10149d50a2bd6 |
hex | 76b0e3b1638b |
130502106375051 has 4 divisors (see below), whose sum is σ = 174002808500072. Its totient is φ = 87001404250032.
The previous prime is 130502106375031. The next prime is 130502106375079. The reversal of 130502106375051 is 150573601205031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 130502106375051 - 214 = 130502106358667 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130502106375001) 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, 21750351062506 + ... + 21750351062511.
It is an arithmetic number, because the mean of its divisors is an integer number (43500702125018).
Almost surely, 2130502106375051 is an apocalyptic number.
130502106375051 is a deficient number, since it is larger than the sum of its proper divisors (43500702125021).
130502106375051 is an equidigital number, since it uses as much as digits as its factorization.
130502106375051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43500702125020.
The product of its (nonzero) digits is 94500, while the sum is 39.
The spelling of 130502106375051 in words is "one hundred thirty trillion, five hundred two billion, one hundred six million, three hundred seventy-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •