Base | Representation |
---|---|
bin | 10111111011011011… |
… | …111100101110010000 |
3 | 2110022121101001012220 |
4 | 113323123330232100 |
5 | 410104432304204 |
6 | 15445303221040 |
7 | 1566462654540 |
oct | 277333745620 |
9 | 73277331186 |
10 | 25693244304 |
11 | a995191802 |
12 | 4b90747780 |
13 | 256604b950 |
14 | 135a483320 |
15 | a059ad1d9 |
hex | 5fb6fcb90 |
25693244304 has 320 divisors, whose sum is σ = 91054172160. Its totient is φ = 6041640960.
The previous prime is 25693244263. The next prime is 25693244309. The reversal of 25693244304 is 40344239652.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (25693244309) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1401759 + ... + 1419969.
It is an arithmetic number, because the mean of its divisors is an integer number (284544288).
Almost surely, 225693244304 is an apocalyptic number.
25693244304 is a gapful number since it is divisible by the number (24) 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 25693244304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45527086080).
25693244304 is an abundant number, since it is smaller than the sum of its proper divisors (65360927856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25693244304 is a wasteful number, since it uses less digits than its factorization.
25693244304 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18278 (or 18272 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 42.
The spelling of 25693244304 in words is "twenty-five billion, six hundred ninety-three million, two hundred forty-four thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •