Base | Representation |
---|---|
bin | 1111000010110… |
… | …00110011001001 |
3 | 22210110021000221 |
4 | 13201120303021 |
5 | 224301132331 |
6 | 20304430041 |
7 | 3061423105 |
oct | 741306311 |
9 | 283407027 |
10 | 126192841 |
11 | 65261605 |
12 | 36318321 |
13 | 201b4928 |
14 | 12a8c905 |
15 | b12a711 |
hex | 7858cc9 |
126192841 has 4 divisors (see below), whose sum is σ = 128573892. Its totient is φ = 123811792.
The previous prime is 126192827. The next prime is 126192877. The reversal of 126192841 is 148291621.
It is a happy number.
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 87703225 + 38489616 = 9365^2 + 6204^2 .
It is a cyclic number.
It is not a de Polignac number, because 126192841 - 213 = 126184649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126192797 and 126192806.
It is not an unprimeable number, because it can be changed into a prime (126192811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1190446 + ... + 1190551.
It is an arithmetic number, because the mean of its divisors is an integer number (32143473).
Almost surely, 2126192841 is an apocalyptic number.
It is an amenable number.
126192841 is a deficient number, since it is larger than the sum of its proper divisors (2381051).
126192841 is an equidigital number, since it uses as much as digits as its factorization.
126192841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2381050.
The product of its digits is 6912, while the sum is 34.
The square root of 126192841 is about 11233.5586970470. The cubic root of 126192841 is about 501.5854222260.
The spelling of 126192841 in words is "one hundred twenty-six million, one hundred ninety-two thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •