Base | Representation |
---|---|
bin | 100100110001100110100… |
… | …0010000101001111101111 |
3 | 122220012002100102221012001 |
4 | 1021203031002011033233 |
5 | 1130302222240241101 |
6 | 14425531224553131 |
7 | 1031106540112651 |
oct | 111431502051757 |
9 | 18805070387161 |
10 | 5054321415151 |
11 | 1679586744798 |
12 | 69768a0227a7 |
13 | 2a880b210a78 |
14 | 1368b7db66d1 |
15 | 8b71b67a901 |
hex | 498cd0853ef |
5054321415151 has 8 divisors (see below), whose sum is σ = 5058230312880. Its totient is φ = 5050413690432.
The previous prime is 5054321415133. The next prime is 5054321415193. The reversal of 5054321415151 is 1515141234505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5054321415151 - 211 = 5054321413103 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5054321415151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5054321415251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8427780 + ... + 9007558.
It is an arithmetic number, because the mean of its divisors is an integer number (632278789110).
Almost surely, 25054321415151 is an apocalyptic number.
5054321415151 is a deficient number, since it is larger than the sum of its proper divisors (3908897729).
5054321415151 is a wasteful number, since it uses less digits than its factorization.
5054321415151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586505.
The product of its (nonzero) digits is 60000, while the sum is 37.
Adding to 5054321415151 its reverse (1515141234505), we get a palindrome (6569462649656).
The spelling of 5054321415151 in words is "five trillion, fifty-four billion, three hundred twenty-one million, four hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •