Base | Representation |
---|---|
bin | 10111011001010110… |
… | …000000110111000101 |
3 | 2101211202002101102211 |
4 | 113121112000313011 |
5 | 402422020404140 |
6 | 15312431503421 |
7 | 1546346132644 |
oct | 273126006705 |
9 | 71752071384 |
10 | 25121263045 |
11 | a72133081a |
12 | 4a51087b71 |
13 | 24a46b32b8 |
14 | 130451135b |
15 | 9c06772ea |
hex | 5d9580dc5 |
25121263045 has 4 divisors (see below), whose sum is σ = 30145515660. Its totient is φ = 20097010432.
The previous prime is 25121262989. The next prime is 25121263061. The reversal of 25121263045 is 54036212152.
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 6842763841 + 18278499204 = 82721^2 + 135198^2 .
It is a cyclic number.
It is not a de Polignac number, because 25121263045 - 27 = 25121262917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25121262998 and 25121263016.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2512126300 + ... + 2512126309.
It is an arithmetic number, because the mean of its divisors is an integer number (7536378915).
Almost surely, 225121263045 is an apocalyptic number.
It is an amenable number.
25121263045 is a deficient number, since it is larger than the sum of its proper divisors (5024252615).
25121263045 is an equidigital number, since it uses as much as digits as its factorization.
25121263045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5024252614.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 25121263045 its reverse (54036212152), we get a palindrome (79157475197).
The spelling of 25121263045 in words is "twenty-five billion, one hundred twenty-one million, two hundred sixty-three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •