Base | Representation |
---|---|
bin | 1011011101110011110100… |
… | …10101010011110110101111 |
3 | 10022021101110220010111011001 |
4 | 11232321322111103312233 |
5 | 11301044232132343343 |
6 | 125342532104141131 |
7 | 5211421202361106 |
oct | 556717225236657 |
9 | 108241426114131 |
10 | 25213510434223 |
11 | 8040a98363a11 |
12 | 29b26697677a7 |
13 | 110b815735337 |
14 | 6324aa16103d |
15 | 2dacdbba844d |
hex | 16ee7a553daf |
25213510434223 has 2 divisors, whose sum is σ = 25213510434224. Its totient is φ = 25213510434222.
The previous prime is 25213510434199. The next prime is 25213510434257. The reversal of 25213510434223 is 32243401531252.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 25213510434223 - 29 = 25213510433711 is a prime.
It is a super-2 number, since 2×252135104342232 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25213510434293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12606755217111 + 12606755217112.
It is an arithmetic number, because the mean of its divisors is an integer number (12606755217112).
Almost surely, 225213510434223 is an apocalyptic number.
25213510434223 is a deficient number, since it is larger than the sum of its proper divisors (1).
25213510434223 is an equidigital number, since it uses as much as digits as its factorization.
25213510434223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 25213510434223 its reverse (32243401531252), we get a palindrome (57456911965475).
The spelling of 25213510434223 in words is "twenty-five trillion, two hundred thirteen billion, five hundred ten million, four hundred thirty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •