Base | Representation |
---|---|
bin | 1111001000110… |
… | …00001011110000 |
3 | 22211221002100200 |
4 | 13210120023300 |
5 | 230001224002 |
6 | 20333315200 |
7 | 3101166420 |
oct | 744301360 |
9 | 284832320 |
10 | 126976752 |
11 | 65747571 |
12 | 36635b00 |
13 | 203ca696 |
14 | 12c14480 |
15 | b232b1c |
hex | 79182f0 |
126976752 has 120 divisors (see below), whose sum is σ = 410402304. Its totient is φ = 35897472.
The previous prime is 126976747. The next prime is 126976771. The reversal of 126976752 is 257679621.
It is a super-2 number, since 2×1269767522 = 32246191096939008, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 126976698 and 126976707.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 103213 + ... + 104435.
Almost surely, 2126976752 is an apocalyptic number.
126976752 is a gapful number since it is divisible by the number (12) 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 126976752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205201152).
126976752 is an abundant number, since it is smaller than the sum of its proper divisors (283425552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126976752 is a wasteful number, since it uses less digits than its factorization.
126976752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1347 (or 1338 counting only the distinct ones).
The product of its digits is 317520, while the sum is 45.
The square root of 126976752 is about 11268.3961591701. The cubic root of 126976752 is about 502.6218966178.
The spelling of 126976752 in words is "one hundred twenty-six million, nine hundred seventy-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •