Base | Representation |
---|---|
bin | 111100101111001011… |
… | …0110010011110110011 |
3 | 110110200000220201100021 |
4 | 1321132112302132303 |
5 | 4114111101113443 |
6 | 135530351304311 |
7 | 12265141066423 |
oct | 1713626623663 |
9 | 413600821307 |
10 | 130432051123 |
11 | 50352546580 |
12 | 2134151b097 |
13 | c3b855889a |
14 | 6454a14483 |
15 | 35d5c589ed |
hex | 1e5e5b27b3 |
130432051123 has 4 divisors (see below), whose sum is σ = 142289510328. Its totient is φ = 118574591920.
The previous prime is 130432051117. The next prime is 130432051229. The reversal of 130432051123 is 321150234031.
It is a happy number.
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 130432051123 - 217 = 130431920051 is a prime.
It is a super-2 number, since 2×1304320511232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130432051823) 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, 5928729586 + ... + 5928729607.
It is an arithmetic number, because the mean of its divisors is an integer number (35572377582).
Almost surely, 2130432051123 is an apocalyptic number.
130432051123 is a deficient number, since it is larger than the sum of its proper divisors (11857459205).
130432051123 is a wasteful number, since it uses less digits than its factorization.
130432051123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11857459204.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 130432051123 its reverse (321150234031), we get a palindrome (451582285154).
The spelling of 130432051123 in words is "one hundred thirty billion, four hundred thirty-two million, fifty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •