Base | Representation |
---|---|
bin | 1011011111111100100110… |
… | …00101111010111010001111 |
3 | 10022112102000100022212010022 |
4 | 11233332103011322322033 |
5 | 11303300123202234234 |
6 | 125440354320332355 |
7 | 5216630644616423 |
oct | 557762305727217 |
9 | 108472010285108 |
10 | 25286940274319 |
11 | 806a149612679 |
12 | 2a049411740bb |
13 | 1115718622a69 |
14 | 635c744b0b83 |
15 | 2dcb88467e2e |
hex | 16ff9317ae8f |
25286940274319 has 2 divisors, whose sum is σ = 25286940274320. Its totient is φ = 25286940274318.
The previous prime is 25286940274279. The next prime is 25286940274327. The reversal of 25286940274319 is 91347204968252.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 25286940274319 - 240 = 24187428646543 is a prime.
It is a super-2 number, since 2×252869402743192 (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 (25286940874319) 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, 12643470137159 + 12643470137160.
It is an arithmetic number, because the mean of its divisors is an integer number (12643470137160).
It is a 1-persistent number, because it is pandigital, but 2⋅25286940274319 = 50573880548638 is not.
Almost surely, 225286940274319 is an apocalyptic number.
25286940274319 is a deficient number, since it is larger than the sum of its proper divisors (1).
25286940274319 is an equidigital number, since it uses as much as digits as its factorization.
25286940274319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52254720, while the sum is 62.
The spelling of 25286940274319 in words is "twenty-five trillion, two hundred eighty-six billion, nine hundred forty million, two hundred seventy-four thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •