Base | Representation |
---|---|
bin | 1011011110101111010010… |
… | …00000100001000000110111 |
3 | 10022101102212120020022201020 |
4 | 11233113221000201000313 |
5 | 11302110121044301033 |
6 | 125405331422432223 |
7 | 5213631224412621 |
oct | 557275100410067 |
9 | 108342776208636 |
10 | 25245432025143 |
11 | 805358925a710 |
12 | 29b8898132673 |
13 | 1111831c50585 |
14 | 633c57893c11 |
15 | 2dba593576b3 |
hex | 16f5e9021037 |
25245432025143 has 16 divisors (see below), whose sum is σ = 36722466034176. Its totient is φ = 15299496152640.
The previous prime is 25245432025141. The next prime is 25245432025169. The reversal of 25245432025143 is 34152023454252.
It is not a de Polignac number, because 25245432025143 - 21 = 25245432025141 is a prime.
It is a super-2 number, since 2×252454320251432 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 25245432025095 and 25245432025104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25245432025141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18472255 + ... + 19791792.
It is an arithmetic number, because the mean of its divisors is an integer number (2295154127136).
Almost surely, 225245432025143 is an apocalyptic number.
25245432025143 is a deficient number, since it is larger than the sum of its proper divisors (11477034009033).
25245432025143 is a wasteful number, since it uses less digits than its factorization.
25245432025143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38284054.
The product of its (nonzero) digits is 1152000, while the sum is 42.
Adding to 25245432025143 its reverse (34152023454252), we get a palindrome (59397455479395).
The spelling of 25245432025143 in words is "twenty-five trillion, two hundred forty-five billion, four hundred thirty-two million, twenty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •