Base | Representation |
---|---|
bin | 111100110011011101… |
… | …0000101111101000011 |
3 | 110111001000212212122121 |
4 | 1321212322011331003 |
5 | 4114404313224101 |
6 | 135552514345111 |
7 | 12301532431606 |
oct | 1714672057503 |
9 | 414030785577 |
10 | 130575523651 |
11 | 5041652a611 |
12 | 2138158b197 |
13 | c40c1b0681 |
14 | 6469ac033d |
15 | 35e36490a1 |
hex | 1e66e85f43 |
130575523651 has 4 divisors (see below), whose sum is σ = 130624412704. Its totient is φ = 130526634600.
The previous prime is 130575523613. The next prime is 130575523721. The reversal of 130575523651 is 156325575031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130575523651 - 229 = 130038652739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130575523598 and 130575523607.
It is not an unprimeable number, because it can be changed into a prime (130575523951) 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, 24440520 + ... + 24445861.
It is an arithmetic number, because the mean of its divisors is an integer number (32656103176).
Almost surely, 2130575523651 is an apocalyptic number.
130575523651 is a deficient number, since it is larger than the sum of its proper divisors (48889053).
130575523651 is an equidigital number, since it uses as much as digits as its factorization.
130575523651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48889052.
The product of its (nonzero) digits is 472500, while the sum is 43.
The spelling of 130575523651 in words is "one hundred thirty billion, five hundred seventy-five million, five hundred twenty-three thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •