Base | Representation |
---|---|
bin | 11101101011011110001000… |
… | …001100110011010100100101 |
3 | 122010011121101110112200012112 |
4 | 131223132020030303110211 |
5 | 114102103220323300203 |
6 | 1141340540232130405 |
7 | 36331345563440636 |
oct | 3553361014632445 |
9 | 563147343480175 |
10 | 130530636150053 |
11 | 386558061a86a7 |
12 | 12781865b36a05 |
13 | 57aaca880cca9 |
14 | 2433a0610388d |
15 | 1015604ab46d8 |
hex | 76b788333525 |
130530636150053 has 4 divisors (see below), whose sum is σ = 138208908864780. Its totient is φ = 122852363435328.
The previous prime is 130530636149993. The next prime is 130530636150059. The reversal of 130530636150053 is 350051636035031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 66291805752484 + 64238830397569 = 8141978^2 + 8014913^2 .
It is a cyclic number.
It is not a de Polignac number, because 130530636150053 - 222 = 130530631955749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130530636150059) 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, 3839136357338 + ... + 3839136357371.
It is an arithmetic number, because the mean of its divisors is an integer number (34552227216195).
Almost surely, 2130530636150053 is an apocalyptic number.
It is an amenable number.
130530636150053 is a deficient number, since it is larger than the sum of its proper divisors (7678272714727).
130530636150053 is an equidigital number, since it uses as much as digits as its factorization.
130530636150053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7678272714726.
The product of its (nonzero) digits is 364500, while the sum is 41.
The spelling of 130530636150053 in words is "one hundred thirty trillion, five hundred thirty billion, six hundred thirty-six million, one hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •