Base | Representation |
---|---|
bin | 1111000111100… |
… | …00111000000000 |
3 | 22211121220111102 |
4 | 13203300320000 |
5 | 224431100434 |
6 | 20330033532 |
7 | 3066626126 |
oct | 743607000 |
9 | 284556442 |
10 | 126815744 |
11 | 65647600 |
12 | 365788a8 |
13 | 20372303 |
14 | 12bb1916 |
15 | b20007e |
hex | 78f0e00 |
126815744 has 120 divisors (see below), whose sum is σ = 293887440. Its totient is φ = 54517760.
The previous prime is 126815737. The next prime is 126815789. The reversal of 126815744 is 447518621.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 126815698 and 126815707.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1424852 + ... + 1424940.
It is an arithmetic number, because the mean of its divisors is an integer number (2449062).
Almost surely, 2126815744 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 126815744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146943720).
126815744 is an abundant number, since it is smaller than the sum of its proper divisors (167071696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126815744 is an equidigital number, since it uses as much as digits as its factorization.
126815744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152 (or 125 counting only the distinct ones).
The product of its digits is 53760, while the sum is 38.
The square root of 126815744 is about 11261.2496642247. The cubic root of 126815744 is about 502.4093632885.
The spelling of 126815744 in words is "one hundred twenty-six million, eight hundred fifteen thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •