Base | Representation |
---|---|
bin | 111100110010010010… |
… | …1011010111011111101 |
3 | 110110221022112211001021 |
4 | 1321210211122323331 |
5 | 4114314324101031 |
6 | 135545003144141 |
7 | 12300550240324 |
oct | 1714445327375 |
9 | 413838484037 |
10 | 130536550141 |
11 | 503a65301a8 |
12 | 21370515051 |
13 | c4040b611a |
14 | 64648570bb |
15 | 35deeeb511 |
hex | 1e6495aefd |
130536550141 has 4 divisors (see below), whose sum is σ = 131803895392. Its totient is φ = 129269204892.
The previous prime is 130536550139. The next prime is 130536550147. The reversal of 130536550141 is 141055635031.
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 not a de Polignac number, because 130536550141 - 21 = 130536550139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130536550097 and 130536550106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130536550147) 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 3 ways as a sum of consecutive naturals, for example, 633672471 + ... + 633672676.
It is an arithmetic number, because the mean of its divisors is an integer number (32950973848).
Almost surely, 2130536550141 is an apocalyptic number.
It is an amenable number.
130536550141 is a deficient number, since it is larger than the sum of its proper divisors (1267345251).
130536550141 is a wasteful number, since it uses less digits than its factorization.
130536550141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267345250.
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 130536550141 in words is "one hundred thirty billion, five hundred thirty-six million, five hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •