Base | Representation |
---|---|
bin | 100101010100111010001… |
… | …1100000000101101111011 |
3 | 200011102210120212021011202 |
4 | 1022221310130000231323 |
5 | 1133023013434421301 |
6 | 14524431131444415 |
7 | 1036432522226555 |
oct | 112516434005573 |
9 | 20142716767152 |
10 | 5130144451451 |
11 | 16a8755889158 |
12 | 6aa30abb670b |
13 | 2b2a02b74316 |
14 | 13a42c0d44d5 |
15 | 8d6a80ba66b |
hex | 4aa74700b7b |
5130144451451 has 4 divisors (see below), whose sum is σ = 5160863879472. Its totient is φ = 5099425023432.
The previous prime is 5130144451379. The next prime is 5130144451489. The reversal of 5130144451451 is 1541544410315.
5130144451451 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5130144451451 - 218 = 5130144189307 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5130134451451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15359713760 + ... + 15359714093.
It is an arithmetic number, because the mean of its divisors is an integer number (1290215969868).
Almost surely, 25130144451451 is an apocalyptic number.
5130144451451 is a deficient number, since it is larger than the sum of its proper divisors (30719428021).
5130144451451 is a wasteful number, since it uses less digits than its factorization.
5130144451451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30719428020.
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 5130144451451 its reverse (1541544410315), we get a palindrome (6671688861766).
The spelling of 5130144451451 in words is "five trillion, one hundred thirty billion, one hundred forty-four million, four hundred fifty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •