Base | Representation |
---|---|
bin | 10111111000111001… |
… | …100110000101011000 |
3 | 2110012122021202210112 |
4 | 113320321212011120 |
5 | 410013033343443 |
6 | 15441143103452 |
7 | 1565435135000 |
oct | 277071460530 |
9 | 73178252715 |
10 | 25650684248 |
11 | a973162802 |
12 | 4b7a441b88 |
13 | 255a299a97 |
14 | 1354965000 |
15 | a01da2b18 |
hex | 5f8e66158 |
25650684248 has 64 divisors (see below), whose sum is σ = 56401920000. Its totient is φ = 10931526816.
The previous prime is 25650684221. The next prime is 25650684313. The reversal of 25650684248 is 84248605652.
It is a junction number, because it is equal to n+sod(n) for n = 25650684196 and 25650684205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 465065 + ... + 517287.
It is an arithmetic number, because the mean of its divisors is an integer number (881280000).
Almost surely, 225650684248 is an apocalyptic number.
25650684248 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25650684248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28200960000).
25650684248 is an abundant number, since it is smaller than the sum of its proper divisors (30751235752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25650684248 is a wasteful number, since it uses less digits than its factorization.
25650684248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52429 (or 52411 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 50.
The spelling of 25650684248 in words is "twenty-five billion, six hundred fifty million, six hundred eighty-four thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •