Base | Representation |
---|---|
bin | 111100110010101110… |
… | …0100010110001100011 |
3 | 110110222022201221202021 |
4 | 1321211130202301203 |
5 | 4114332024001123 |
6 | 135550241002311 |
7 | 12301114122553 |
oct | 1714534426143 |
9 | 413868657667 |
10 | 130551000163 |
11 | 504036aa771 |
12 | 21375323397 |
13 | c4070a532c |
14 | 6466739163 |
15 | 35e1402c5d |
hex | 1e65722c63 |
130551000163 has 4 divisors (see below), whose sum is σ = 130726708848. Its totient is φ = 130375291480.
The previous prime is 130551000157. The next prime is 130551000169. The reversal of 130551000163 is 361000155031.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (130551000157) and next prime (130551000169).
It is a cyclic number.
It is not a de Polignac number, because 130551000163 - 25 = 130551000131 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130551000169) 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 3 ways as a sum of consecutive naturals, for example, 87853228 + ... + 87854713.
It is an arithmetic number, because the mean of its divisors is an integer number (32681677212).
Almost surely, 2130551000163 is an apocalyptic number.
130551000163 is a deficient number, since it is larger than the sum of its proper divisors (175708685).
130551000163 is an equidigital number, since it uses as much as digits as its factorization.
130551000163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175708684.
The product of its (nonzero) digits is 1350, while the sum is 25.
Adding to 130551000163 its reverse (361000155031), we get a palindrome (491551155194).
The spelling of 130551000163 in words is "one hundred thirty billion, five hundred fifty-one million, one hundred sixty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •