Base | Representation |
---|---|
bin | 1111001000000… |
… | …00000000000000 |
3 | 22211202001110221 |
4 | 13210000000000 |
5 | 224440041241 |
6 | 20331232424 |
7 | 3100304551 |
oct | 744000000 |
9 | 284661427 |
10 | 126877696 |
11 | 6568a100 |
12 | 365a8714 |
13 | 2039457a |
14 | 12bca328 |
15 | b2135d1 |
hex | 7900000 |
126877696 has 63 divisors (see below), whose sum is σ = 278921083. Its totient is φ = 57671680.
The previous prime is 126877693. The next prime is 126877741. The reversal of 126877696 is 696778621.
It is a happy number.
The square root of 126877696 is 11264.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a nialpdrome in base 8.
It is not an unprimeable number, because it can be changed into a prime (126877693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 11534331 + ... + 11534341.
Almost surely, 2126877696 is an apocalyptic number.
126877696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
126877696 is the 11264-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126877696
126877696 is an abundant number, since it is smaller than the sum of its proper divisors (152043387).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126877696 is an frugal number, since it uses more digits than its factorization.
126877696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62 (or 13 counting only the distinct ones).
The product of its digits is 1524096, while the sum is 52.
The cubic root of 126877696 is about 502.4911622745.
The spelling of 126877696 in words is "one hundred twenty-six million, eight hundred seventy-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •