Base | Representation |
---|---|
bin | 100100111110011011000… |
… | …1111001010000111000001 |
3 | 122222211011022002200202011 |
4 | 1021330312033022013001 |
5 | 1131230120200120101 |
6 | 14450323400052521 |
7 | 1033103064305143 |
oct | 111746617120701 |
9 | 18884138080664 |
10 | 5081856254401 |
11 | 168a22640aa93 |
12 | 6a0a93464141 |
13 | 2ab2a8954264 |
14 | 137d6ac7cc93 |
15 | 8c2cdb5b751 |
hex | 49f363ca1c1 |
5081856254401 has 4 divisors (see below), whose sum is σ = 5118950095812. Its totient is φ = 5044762412992.
The previous prime is 5081856254393. The next prime is 5081856254429. The reversal of 5081856254401 is 1044526581805.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2383642649025 + 2698213605376 = 1543905^2 + 1642624^2 .
It is a cyclic number.
It is not a de Polignac number, because 5081856254401 - 23 = 5081856254393 is a prime.
It is a super-2 number, since 2×50818562544012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5081856254701) 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, 18546920500 + ... + 18546920773.
It is an arithmetic number, because the mean of its divisors is an integer number (1279737523953).
Almost surely, 25081856254401 is an apocalyptic number.
It is an amenable number.
5081856254401 is a deficient number, since it is larger than the sum of its proper divisors (37093841411).
5081856254401 is a wasteful number, since it uses less digits than its factorization.
5081856254401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37093841410.
The product of its (nonzero) digits is 1536000, while the sum is 49.
The spelling of 5081856254401 in words is "five trillion, eighty-one billion, eight hundred fifty-six million, two hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •