Base | Representation |
---|---|
bin | 10111111111011101… |
… | …100011101101100100 |
3 | 2110111022102221221020 |
4 | 113333131203231210 |
5 | 410224224300022 |
6 | 15500114451140 |
7 | 1601242655220 |
oct | 277735435544 |
9 | 73438387836 |
10 | 25760775012 |
11 | aa1a316605 |
12 | 4bab293ab0 |
13 | 257703454b |
14 | 1365421780 |
15 | a0b89c35c |
hex | 5ff763b64 |
25760775012 has 96 divisors (see below), whose sum is σ = 70230343680. Its totient is φ = 7196092800.
The previous prime is 25760775011. The next prime is 25760775037. The reversal of 25760775012 is 21057706752.
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 (25760775011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4541314 + ... + 4546982.
It is an arithmetic number, because the mean of its divisors is an integer number (731566080).
Almost surely, 225760775012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25760775012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35115171840).
25760775012 is an abundant number, since it is smaller than the sum of its proper divisors (44469568668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25760775012 is a wasteful number, since it uses less digits than its factorization.
25760775012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6881 (or 6879 counting only the distinct ones).
The product of its (nonzero) digits is 205800, while the sum is 42.
The spelling of 25760775012 in words is "twenty-five billion, seven hundred sixty million, seven hundred seventy-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •