Base | Representation |
---|---|
bin | 10111010010001000… |
… | …011001010011100001 |
3 | 2101112022101102101000 |
4 | 113102020121103201 |
5 | 402200031041031 |
6 | 15252430102213 |
7 | 1543346432640 |
oct | 272210312341 |
9 | 71468342330 |
10 | 25000252641 |
11 | a669a99921 |
12 | 4a1864a969 |
13 | 24855c4500 |
14 | 12d2411357 |
15 | 9b4c223e6 |
hex | 5d22194e1 |
25000252641 has 96 divisors (see below), whose sum is σ = 46203371520. Its totient is φ = 13080989376.
The previous prime is 25000252639. The next prime is 25000252679. The reversal of 25000252641 is 14625200052.
It is not a de Polignac number, because 25000252641 - 21 = 25000252639 is a prime.
It is a super-2 number, since 2×250002526412 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (25000252601) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4053426 + ... + 4059588.
It is an arithmetic number, because the mean of its divisors is an integer number (481285120).
Almost surely, 225000252641 is an apocalyptic number.
25000252641 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
25000252641 is a deficient number, since it is larger than the sum of its proper divisors (21203118879).
25000252641 is a wasteful number, since it uses less digits than its factorization.
25000252641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6332 (or 6313 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 25000252641 its reverse (14625200052), we get a palindrome (39625452693).
The spelling of 25000252641 in words is "twenty-five billion, two hundred fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •