Base | Representation |
---|---|
bin | 111011000000110000… |
… | …1001111001000000000 |
3 | 110010002211020220012011 |
4 | 1312001201033020000 |
5 | 4034014104301102 |
6 | 134114555542304 |
7 | 12104261640430 |
oct | 1660141171000 |
9 | 403084226164 |
10 | 126727025152 |
11 | 49821113742 |
12 | 2068875a994 |
13 | bc47a95420 |
14 | 61c29262c0 |
15 | 346a84d2d7 |
hex | 1d8184f200 |
126727025152 has 160 divisors (see below), whose sum is σ = 313061962752. Its totient is φ = 49904861184.
The previous prime is 126727025149. The next prime is 126727025153. The reversal of 126727025152 is 251520727621.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (126727025153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10383918 + ... + 10396114.
Almost surely, 2126727025152 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 126727025152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156530981376).
126727025152 is an abundant number, since it is smaller than the sum of its proper divisors (186334937600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126727025152 is a wasteful number, since it uses less digits than its factorization.
126727025152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12458 (or 12442 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 40.
The spelling of 126727025152 in words is "one hundred twenty-six billion, seven hundred twenty-seven million, twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •