Base | Representation |
---|---|
bin | 1111000101010… |
… | …11001010000000 |
3 | 22211002101202211 |
4 | 13202223022000 |
5 | 224342431201 |
6 | 20315551504 |
7 | 3064326433 |
oct | 742531200 |
9 | 284071684 |
10 | 126530176 |
11 | 65471aa3 |
12 | 3645b594 |
13 | 202a2336 |
14 | 12b3981a |
15 | b195651 |
hex | 78ab280 |
126530176 has 32 divisors (see below), whose sum is σ = 263037600. Its totient is φ = 60513024.
The previous prime is 126530137. The next prime is 126530203. The reversal of 126530176 is 671035621.
It is a tau number, because it is divible by the number of its divisors (32).
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 3 ways as a sum of consecutive naturals, for example, 18546 + ... + 24433.
It is an arithmetic number, because the mean of its divisors is an integer number (8219925).
Almost surely, 2126530176 is an apocalyptic number.
126530176 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
126530176 is an abundant number, since it is smaller than the sum of its proper divisors (136507424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126530176 is an equidigital number, since it uses as much as digits as its factorization.
126530176 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43016 (or 43004 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 126530176 is about 11248.5632860379. The cubic root of 126530176 is about 502.0319657110.
Adding to 126530176 its reverse (671035621), we get a palindrome (797565797).
Subtracting 126530176 from its reverse (671035621), we obtain a palindrome (544505445).
The spelling of 126530176 in words is "one hundred twenty-six million, five hundred thirty thousand, one hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •