Base | Representation |
---|---|
bin | 100100111110010110100… |
… | …1010011000101100001101 |
3 | 122222210202200121210120122 |
4 | 1021330231022120230031 |
5 | 1131224312211232321 |
6 | 14450300320554325 |
7 | 1033066235242343 |
oct | 111745512305415 |
9 | 18883680553518 |
10 | 5081704008461 |
11 | 168a1584843a3 |
12 | 6a0a504829a5 |
13 | 2ab283249cc2 |
14 | 137d5496b993 |
15 | 8c2c05d68ab |
hex | 49f2d298b0d |
5081704008461 has 4 divisors (see below), whose sum is σ = 5081717078400. Its totient is φ = 5081690938524.
The previous prime is 5081704008449. The next prime is 5081704008473. The reversal of 5081704008461 is 1648004071805.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (5081704008449) and next prime (5081704008473).
It is a cyclic number.
It is not a de Polignac number, because 5081704008461 - 210 = 5081704007437 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 (5081704008431) 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, 5933291 + ... + 6735528.
It is an arithmetic number, because the mean of its divisors is an integer number (1270429269600).
Almost surely, 25081704008461 is an apocalyptic number.
It is an amenable number.
5081704008461 is a deficient number, since it is larger than the sum of its proper divisors (13069939).
5081704008461 is a wasteful number, since it uses less digits than its factorization.
5081704008461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13069938.
The product of its (nonzero) digits is 215040, while the sum is 44.
The spelling of 5081704008461 in words is "five trillion, eighty-one billion, seven hundred four million, eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •