Base | Representation |
---|---|
bin | 10111101011110000… |
… | …010000010110101101 |
3 | 2102122021021120011222 |
4 | 113223300100112231 |
5 | 404040103212031 |
6 | 15403223553125 |
7 | 1560116361641 |
oct | 275360202655 |
9 | 72567246158 |
10 | 25430132141 |
11 | a86a712737 |
12 | 4b185bb7a5 |
13 | 2523697c8b |
14 | 1333552c21 |
15 | 9dc838e7b |
hex | 5ebc105ad |
25430132141 has 4 divisors (see below), whose sum is σ = 25544168832. Its totient is φ = 25316095452.
The previous prime is 25430132111. The next prime is 25430132177. The reversal of 25430132141 is 14123103452.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 25430132141 - 222 = 25425937837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 25430132141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25430132111) 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, 57018011 + ... + 57018456.
It is an arithmetic number, because the mean of its divisors is an integer number (6386042208).
Almost surely, 225430132141 is an apocalyptic number.
It is an amenable number.
25430132141 is a deficient number, since it is larger than the sum of its proper divisors (114036691).
25430132141 is a wasteful number, since it uses less digits than its factorization.
25430132141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114036690.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 25430132141 its reverse (14123103452), we get a palindrome (39553235593).
The spelling of 25430132141 in words is "twenty-five billion, four hundred thirty million, one hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •