Base | Representation |
---|---|
bin | 1111000101100… |
… | …00111010001101 |
3 | 22211010121002121 |
4 | 13202300322031 |
5 | 224344204431 |
6 | 20320252541 |
7 | 3064455226 |
oct | 742607215 |
9 | 284117077 |
10 | 126553741 |
11 | 65488776 |
12 | 36471151 |
13 | 202acc92 |
14 | 12b4424d |
15 | b19c611 |
hex | 78b0e8d |
126553741 has 4 divisors (see below), whose sum is σ = 126684252. Its totient is φ = 126423232.
The previous prime is 126553723. The next prime is 126553747. The reversal of 126553741 is 147355621.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 119902500 + 6651241 = 10950^2 + 2579^2 .
It is a cyclic number.
It is not a de Polignac number, because 126553741 - 211 = 126551693 is a prime.
It is a super-2 number, since 2×1265537412 = 32031698722190162, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126553697 and 126553706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126553747) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63790 + ... + 65743.
It is an arithmetic number, because the mean of its divisors is an integer number (31671063).
Almost surely, 2126553741 is an apocalyptic number.
It is an amenable number.
126553741 is a deficient number, since it is larger than the sum of its proper divisors (130511).
126553741 is an equidigital number, since it uses as much as digits as its factorization.
126553741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130510.
The product of its digits is 25200, while the sum is 34.
The square root of 126553741 is about 11249.6107043755. The cubic root of 126553741 is about 502.0631299473.
The spelling of 126553741 in words is "one hundred twenty-six million, five hundred fifty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •