Base | Representation |
---|---|
bin | 1111000110000… |
… | …11100100010000 |
3 | 22211021110220221 |
4 | 13203003210100 |
5 | 224404131120 |
6 | 20322042424 |
7 | 3065224066 |
oct | 743034420 |
9 | 284243827 |
10 | 126630160 |
11 | 65530128 |
12 | 364a9414 |
13 | 203089b7 |
14 | 12b64036 |
15 | b1b50aa |
hex | 78c3910 |
126630160 has 20 divisors (see below), whose sum is σ = 294415308. Its totient is φ = 50652032.
The previous prime is 126630139. The next prime is 126630167. The reversal of 126630160 is 61036621.
It can be written as a sum of positive squares in 2 ways, for example, as 18386944 + 108243216 = 4288^2 + 10404^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is not an unprimeable number, because it can be changed into a prime (126630167) by changing a digit.
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, 791359 + ... + 791518.
Almost surely, 2126630160 is an apocalyptic number.
126630160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
126630160 is an abundant number, since it is smaller than the sum of its proper divisors (167785148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126630160 is a wasteful number, since it uses less digits than its factorization.
126630160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582890 (or 1582884 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 126630160 is about 11253.0067093200. The cubic root of 126630160 is about 502.1641659236.
Adding to 126630160 its reverse (61036621), we get a palindrome (187666781).
The spelling of 126630160 in words is "one hundred twenty-six million, six hundred thirty thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •