Base | Representation |
---|---|
bin | 10111101111011100… |
… | …010110001011100101 |
3 | 2102210120201220002120 |
4 | 113233130112023211 |
5 | 404201424200424 |
6 | 15413314300153 |
7 | 1561500416550 |
oct | 275734261345 |
9 | 72716656076 |
10 | 25492021989 |
11 | a8a1644475 |
12 | 4b35287659 |
13 | 25334571a5 |
14 | 133b863697 |
15 | 9e2eb1a79 |
hex | 5ef7162e5 |
25492021989 has 32 divisors (see below), whose sum is σ = 40334112000. Its totient is φ = 14012189184.
The previous prime is 25492021981. The next prime is 25492021993. The reversal of 25492021989 is 98912029452.
It is not a de Polignac number, because 25492021989 - 23 = 25492021981 is a prime.
It is a super-2 number, since 2×254920219892 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25492021981) 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, 86017 + ... + 241625.
It is an arithmetic number, because the mean of its divisors is an integer number (1260441000).
Almost surely, 225492021989 is an apocalyptic number.
25492021989 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
25492021989 is a deficient number, since it is larger than the sum of its proper divisors (14842090011).
25492021989 is a wasteful number, since it uses less digits than its factorization.
25492021989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155917.
The product of its (nonzero) digits is 933120, while the sum is 51.
The spelling of 25492021989 in words is "twenty-five billion, four hundred ninety-two million, twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •