Base | Representation |
---|---|
bin | 111010111011111011… |
… | …0110100011001100000 |
3 | 110002200112012121221202 |
4 | 1311313312310121200 |
5 | 4033201104120223 |
6 | 134050525140332 |
7 | 12100252663466 |
oct | 1656766643140 |
9 | 402615177852 |
10 | 126564910688 |
11 | 49748657747 |
12 | 206423ba6a8 |
13 | bc203143c8 |
14 | 61a91a6836 |
15 | 345b4c9428 |
hex | 1d77db4660 |
126564910688 has 48 divisors (see below), whose sum is σ = 255335096016. Its totient is φ = 61722124800.
The previous prime is 126564910687. The next prime is 126564910697. The reversal of 126564910688 is 886019465621.
It is a super-2 number, since 2×1265649106882 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126564910687) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 898970 + ... + 1030182.
It is an arithmetic number, because the mean of its divisors is an integer number (5319481167).
Almost surely, 2126564910688 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 126564910688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127667548008).
126564910688 is an abundant number, since it is smaller than the sum of its proper divisors (128770185328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126564910688 is a wasteful number, since it uses less digits than its factorization.
126564910688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131967 (or 131959 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 56.
The spelling of 126564910688 in words is "one hundred twenty-six billion, five hundred sixty-four million, nine hundred ten thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •