Base | Representation |
---|---|
bin | 10111100100110110… |
… | …001011110000001001 |
3 | 2102100012012220210101 |
4 | 113210312023300021 |
5 | 403320421330031 |
6 | 15343524045401 |
7 | 1554211352266 |
oct | 274466136011 |
9 | 72305186711 |
10 | 25314245641 |
11 | a810260473 |
12 | 4aa5833861 |
13 | 2505681499 |
14 | 1321dc826d |
15 | 9d2597361 |
hex | 5e4d8bc09 |
25314245641 has 16 divisors (see below), whose sum is σ = 27812999808. Its totient is φ = 22943289600.
The previous prime is 25314245633. The next prime is 25314245647. The reversal of 25314245641 is 14654241352.
It is a cyclic number.
It is not a de Polignac number, because 25314245641 - 23 = 25314245633 is a prime.
It is a super-2 number, since 2×253142456412 (a number of 22 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 25314245641.
It is not an unprimeable number, because it can be changed into a prime (25314245647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191970 + ... + 295771.
It is an arithmetic number, because the mean of its divisors is an integer number (1738312488).
Almost surely, 225314245641 is an apocalyptic number.
It is an amenable number.
25314245641 is a deficient number, since it is larger than the sum of its proper divisors (2498754167).
25314245641 is a wasteful number, since it uses less digits than its factorization.
25314245641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487872.
The product of its digits is 115200, while the sum is 37.
Adding to 25314245641 its reverse (14654241352), we get a palindrome (39968486993).
The spelling of 25314245641 in words is "twenty-five billion, three hundred fourteen million, two hundred forty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •