Base | Representation |
---|---|
bin | 1011010111100110001000… |
… | …00111101001000000011011 |
3 | 10021111222100222120122002221 |
4 | 11223303010013221000123 |
5 | 11234100000000000102 |
6 | 125100501430404511 |
7 | 5160122206544113 |
oct | 553630407510033 |
9 | 107458328518087 |
10 | 25000000000027 |
11 | 7a69493284618 |
12 | 2979201500737 |
13 | 10c464a378000 |
14 | 626013a04043 |
15 | 2d54925a7637 |
hex | 16bcc41e901b |
25000000000027 has 32 divisors (see below), whose sum is σ = 27463140024320. Its totient is φ = 22754712183840.
The previous prime is 25000000000013. The next prime is 25000000000097. The reversal of 25000000000027 is 72000000000052.
It is a happy number.
It is not a de Polignac number, because 25000000000027 - 27 = 24999999999899 is a prime.
25000000000027 is a modest number, since divided by 27 gives 25 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 25000000000027.
It is not an unprimeable number, because it can be changed into a prime (25000000000097) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45205252 + ... + 45754942.
It is an arithmetic number, because the mean of its divisors is an integer number (858223125760).
Almost surely, 225000000000027 is an apocalyptic number.
25000000000027 is a deficient number, since it is larger than the sum of its proper divisors (2463140024293).
25000000000027 is a wasteful number, since it uses less digits than its factorization.
25000000000027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550020 (or 549994 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 16.
Adding to 25000000000027 its reverse (72000000000052), we get a palindrome (97000000000079).
The spelling of 25000000000027 in words is "twenty-five trillion, twenty-seven", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •