Base | Representation |
---|---|
bin | 100101010100111110111… |
… | …1101000100011000001111 |
3 | 200011110012201021212110201 |
4 | 1022221331331010120033 |
5 | 1133023330323042033 |
6 | 14524455033514331 |
7 | 1036436501303620 |
oct | 112517575043017 |
9 | 20143181255421 |
10 | 5130304112143 |
11 | 16a8827a19641 |
12 | 6aa3545729a7 |
13 | 2b2a29c764c2 |
14 | 13a4453b5a47 |
15 | 8d6b710747d |
hex | 4aa7df4460f |
5130304112143 has 8 divisors (see below), whose sum is σ = 5863276096640. Its totient is φ = 4397349976920.
The previous prime is 5130304112107. The next prime is 5130304112159. The reversal of 5130304112143 is 3412114030315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5130304112143 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 (5130304112173) 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 7 ways as a sum of consecutive naturals, for example, 3840633 + ... + 5001106.
It is an arithmetic number, because the mean of its divisors is an integer number (732909512080).
Almost surely, 25130304112143 is an apocalyptic number.
5130304112143 is a deficient number, since it is larger than the sum of its proper divisors (732971984497).
5130304112143 is an equidigital number, since it uses as much as digits as its factorization.
5130304112143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8924637.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 5130304112143 its reverse (3412114030315), we get a palindrome (8542418142458).
The spelling of 5130304112143 in words is "five trillion, one hundred thirty billion, three hundred four million, one hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •