Base | Representation |
---|---|
bin | 1011101011011101101111… |
… | …00111010100111101111101 |
3 | 10100221020111211021001200221 |
4 | 11311232313213110331331 |
5 | 11331241122120042223 |
6 | 130342244230421341 |
7 | 5260341000041344 |
oct | 565566747247575 |
9 | 110836454231627 |
10 | 25682690002813 |
11 | 8201a70a62098 |
12 | 2a69588b01851 |
13 | 1143b3753353c |
14 | 64b097db2b5b |
15 | 2e80ebb51b5d |
hex | 175bb79d4f7d |
25682690002813 has 16 divisors (see below), whose sum is σ = 26874581454000. Its totient is φ = 24511834109952.
The previous prime is 25682690002811. The next prime is 25682690002831. The reversal of 25682690002813 is 31820009628652.
It can be written as a sum of positive squares in 8 ways, for example, as 103392473209 + 25579297529604 = 321547^2 + 5057598^2 .
It is a cyclic number.
It is not a de Polignac number, because 25682690002813 - 21 = 25682690002811 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 (25682690002811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3174658 + ... + 7838611.
It is an arithmetic number, because the mean of its divisors is an integer number (1679661340875).
Almost surely, 225682690002813 is an apocalyptic number.
It is an amenable number.
25682690002813 is a deficient number, since it is larger than the sum of its proper divisors (1191891451187).
25682690002813 is a wasteful number, since it uses less digits than its factorization.
25682690002813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11014224.
The product of its (nonzero) digits is 2488320, while the sum is 52.
The spelling of 25682690002813 in words is "twenty-five trillion, six hundred eighty-two billion, six hundred ninety million, two thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •