Base | Representation |
---|---|
bin | 1011011000110101010101… |
… | …10001011100100011101111 |
3 | 10021200001010120210012212120 |
4 | 11230122222301130203233 |
5 | 11240244042223040211 |
6 | 125132213224404023 |
7 | 5163156046310613 |
oct | 554325261344357 |
9 | 107601116705776 |
10 | 25042524424431 |
11 | 7a855251a9018 |
12 | 29854aa916613 |
13 | 10c866642bc07 |
14 | 6280c957d343 |
15 | 2d66309e1d06 |
hex | 16c6aac5c8ef |
25042524424431 has 4 divisors (see below), whose sum is σ = 33390032565912. Its totient is φ = 16695016282952.
The previous prime is 25042524424331. The next prime is 25042524424433. The reversal of 25042524424431 is 13442442524052.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 25042524424431 - 219 = 25042523900143 is a prime.
It is a super-2 number, since 2×250425244244312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25042524424433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4173754070736 + ... + 4173754070741.
It is an arithmetic number, because the mean of its divisors is an integer number (8347508141478).
Almost surely, 225042524424431 is an apocalyptic number.
25042524424431 is a deficient number, since it is larger than the sum of its proper divisors (8347508141481).
25042524424431 is an equidigital number, since it uses as much as digits as its factorization.
25042524424431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8347508141480.
The product of its (nonzero) digits is 1228800, while the sum is 42.
Adding to 25042524424431 its reverse (13442442524052), we get a palindrome (38484966948483).
The spelling of 25042524424431 in words is "twenty-five trillion, forty-two billion, five hundred twenty-four million, four hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •