Base | Representation |
---|---|
bin | 1011100100011110101000… |
… | …11111101010100111100111 |
3 | 10100002021221110121212100021 |
4 | 11302033110133222213213 |
5 | 11313323030012140111 |
6 | 130040110040500011 |
7 | 5234112512554243 |
oct | 562172437524747 |
9 | 110067843555307 |
10 | 25442656365031 |
11 | 811a196258334 |
12 | 2a2ab5a17a607 |
13 | 11273031b50c9 |
14 | 63d607089423 |
15 | 2e1c4dc9dd71 |
hex | 1723d47ea9e7 |
25442656365031 has 12 divisors (see below), whose sum is σ = 25956509147472. Its totient is φ = 24934289859648.
The previous prime is 25442656364977. The next prime is 25442656365047. The reversal of 25442656365031 is 13056365624452.
It is not a de Polignac number, because 25442656365031 - 215 = 25442656332263 is a prime.
It is a super-2 number, since 2×254426563650312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 25442656365031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25442656365331) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5270475 + ... + 8869228.
It is an arithmetic number, because the mean of its divisors is an integer number (2163042428956).
Almost surely, 225442656365031 is an apocalyptic number.
25442656365031 is a deficient number, since it is larger than the sum of its proper divisors (513852782441).
25442656365031 is an equidigital number, since it uses as much as digits as its factorization.
25442656365031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14140090 (or 14139933 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 52.
The spelling of 25442656365031 in words is "twenty-five trillion, four hundred forty-two billion, six hundred fifty-six million, three hundred sixty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •