Base | Representation |
---|---|
bin | 100100110001100011000… |
… | …0011100010001100001101 |
3 | 122220011210012011200022112 |
4 | 1021203012003202030031 |
5 | 1130302002303332331 |
6 | 14425511443553405 |
7 | 1031103616115501 |
oct | 111430603421415 |
9 | 18804705150275 |
10 | 5054204355341 |
11 | 1679526660a49 |
12 | 69765698b865 |
13 | 2a87bcba61cb |
14 | 1368a6624301 |
15 | 8b71125632b |
hex | 498c60e230d |
5054204355341 has 8 divisors (see below), whose sum is σ = 5139923342400. Its totient is φ = 4968487185280.
The previous prime is 5054204355337. The next prime is 5054204355377. The reversal of 5054204355341 is 1435534024505.
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 5054204355341 - 22 = 5054204355337 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 (5054204354341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5904605 + ... + 6706173.
It is an arithmetic number, because the mean of its divisors is an integer number (642490417800).
Almost surely, 25054204355341 is an apocalyptic number.
It is an amenable number.
5054204355341 is a deficient number, since it is larger than the sum of its proper divisors (85718987059).
5054204355341 is a wasteful number, since it uses less digits than its factorization.
5054204355341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908499.
The product of its (nonzero) digits is 720000, while the sum is 41.
Adding to 5054204355341 its reverse (1435534024505), we get a palindrome (6489738379846).
The spelling of 5054204355341 in words is "five trillion, fifty-four billion, two hundred four million, three hundred fifty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •