Base | Representation |
---|---|
bin | 1011011110100101010000… |
… | …11111000001010000110111 |
3 | 10022100220222210112112022220 |
4 | 11233102220133001100313 |
5 | 11302013112430111343 |
6 | 125403042044253423 |
7 | 5213351036455503 |
oct | 557225037012067 |
9 | 108326883475286 |
10 | 25240054535223 |
11 | 8051279861970 |
12 | 29b7837241273 |
13 | 1111185b32188 |
14 | 6338a760b303 |
15 | 2db8421d7183 |
hex | 16f4a87c1437 |
25240054535223 has 32 divisors (see below), whose sum is σ = 37590500535552. Its totient is φ = 14935337894400.
The previous prime is 25240054535177. The next prime is 25240054535251. The reversal of 25240054535223 is 32253545004252.
It is not a de Polignac number, because 25240054535223 - 26 = 25240054535159 is a prime.
It is a super-2 number, since 2×252400545352232 (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 (25240054535123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50261988 + ... + 50761673.
It is an arithmetic number, because the mean of its divisors is an integer number (1174703141736).
Almost surely, 225240054535223 is an apocalyptic number.
25240054535223 is a deficient number, since it is larger than the sum of its proper divisors (12350446000329).
25240054535223 is a wasteful number, since it uses less digits than its factorization.
25240054535223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101023855.
The product of its (nonzero) digits is 1440000, while the sum is 42.
Adding to 25240054535223 its reverse (32253545004252), we get a palindrome (57493599539475).
The spelling of 25240054535223 in words is "twenty-five trillion, two hundred forty billion, fifty-four million, five hundred thirty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •