Base | Representation |
---|---|
bin | 10111010010101110… |
… | …000010010111001101 |
3 | 2101112222221202000222 |
4 | 113102232002113031 |
5 | 402210042321031 |
6 | 15253421401125 |
7 | 1543526341106 |
oct | 272256022715 |
9 | 71488852028 |
10 | 25010120141 |
11 | a674619486 |
12 | 4a1ba091a5 |
13 | 248766a976 |
14 | 12d385d3ad |
15 | 9b5a20e7b |
hex | 5d2b825cd |
25010120141 has 4 divisors (see below), whose sum is σ = 25686069372. Its totient is φ = 24334170912.
The previous prime is 25010120137. The next prime is 25010120153. The reversal of 25010120141 is 14102101052.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24078039241 + 932080900 = 155171^2 + 30530^2 .
It is a cyclic number.
It is not a de Polignac number, because 25010120141 - 22 = 25010120137 is a prime.
It is a super-2 number, since 2×250101201412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25010120041) 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, 337974560 + ... + 337974633.
It is an arithmetic number, because the mean of its divisors is an integer number (6421517343).
Almost surely, 225010120141 is an apocalyptic number.
It is an amenable number.
25010120141 is a deficient number, since it is larger than the sum of its proper divisors (675949231).
25010120141 is an equidigital number, since it uses as much as digits as its factorization.
25010120141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 675949230.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 25010120141 its reverse (14102101052), we get a palindrome (39112221193).
The spelling of 25010120141 in words is "twenty-five billion, ten million, one hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •