Base | Representation |
---|---|
bin | 111010111000010111… |
… | …0101001000111000000 |
3 | 110002101012012010200021 |
4 | 1311300232221013000 |
5 | 4032430000424114 |
6 | 134031014103224 |
7 | 12064301354410 |
oct | 1656056510700 |
9 | 402335163607 |
10 | 126445326784 |
11 | 496970aa577 |
12 | 2060a34ab14 |
13 | bc016049ba |
14 | 6197358640 |
15 | 3450c57024 |
hex | 1d70ba91c0 |
126445326784 has 56 divisors (see below), whose sum is σ = 287087807840. Its totient is φ = 54128894976.
The previous prime is 126445326751. The next prime is 126445326793. The reversal of 126445326784 is 487623544621.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231982 + ... + 553810.
Almost surely, 2126445326784 is an apocalyptic number.
126445326784 is a gapful number since it is divisible by the number (14) 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 126445326784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143543903920).
126445326784 is an abundant number, since it is smaller than the sum of its proper divisors (160642481056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126445326784 is an equidigital number, since it uses as much as digits as its factorization.
126445326784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322725 (or 322715 counting only the distinct ones).
The product of its digits is 7741440, while the sum is 52.
The spelling of 126445326784 in words is "one hundred twenty-six billion, four hundred forty-five million, three hundred twenty-six thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •