Base | Representation |
---|---|
bin | 111100101111100001… |
… | …0100101100010010011 |
3 | 110110200211112000202001 |
4 | 1321133002211202103 |
5 | 4114122021014220 |
6 | 135531441334431 |
7 | 12265340505556 |
oct | 1713702454223 |
9 | 413624460661 |
10 | 130443532435 |
11 | 50358a78667 |
12 | 21345337417 |
13 | c3baa48768 |
14 | 645636269d |
15 | 35d6c7580a |
hex | 1e5f0a5893 |
130443532435 has 8 divisors (see below), whose sum is σ = 161581666176. Its totient is φ = 100988541120.
The previous prime is 130443532433. The next prime is 130443532441. The reversal of 130443532435 is 534235344031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130443532435 - 21 = 130443532433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130443532394 and 130443532403.
It is not an unprimeable number, because it can be changed into a prime (130443532433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 420785434 + ... + 420785743.
It is an arithmetic number, because the mean of its divisors is an integer number (20197708272).
Almost surely, 2130443532435 is an apocalyptic number.
130443532435 is a deficient number, since it is larger than the sum of its proper divisors (31138133741).
130443532435 is an equidigital number, since it uses as much as digits as its factorization.
130443532435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841571213.
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 130443532435 its reverse (534235344031), we get a palindrome (664678876466).
The spelling of 130443532435 in words is "one hundred thirty billion, four hundred forty-three million, five hundred thirty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •