Base | Representation |
---|---|
bin | 111100110101001001… |
… | …1101011010111001111 |
3 | 110111012000012201201202 |
4 | 1321222103223113033 |
5 | 4120013413442002 |
6 | 140002313100115 |
7 | 12303124312544 |
oct | 1715223532717 |
9 | 414160181652 |
10 | 130632562127 |
11 | 50445748451 |
12 | 213986b763b |
13 | c41ac61652 |
14 | 64734cabcb |
15 | 35e8664502 |
hex | 1e6a4eb5cf |
130632562127 has 4 divisors (see below), whose sum is σ = 134846515776. Its totient is φ = 126418608480.
The previous prime is 130632562117. The next prime is 130632562141. The reversal of 130632562127 is 721265236031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 721265236031 = 59 ⋅12224834509.
It is a cyclic number.
It is not a de Polignac number, because 130632562127 - 26 = 130632562063 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 (130632562117) 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, 2106976778 + ... + 2106976839.
It is an arithmetic number, because the mean of its divisors is an integer number (33711628944).
Almost surely, 2130632562127 is an apocalyptic number.
130632562127 is a deficient number, since it is larger than the sum of its proper divisors (4213953649).
130632562127 is an equidigital number, since it uses as much as digits as its factorization.
130632562127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4213953648.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 130632562127 its reverse (721265236031), we get a palindrome (851897798158).
The spelling of 130632562127 in words is "one hundred thirty billion, six hundred thirty-two million, five hundred sixty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •