Base | Representation |
---|---|
bin | 1111000010010… |
… | …00111000000101 |
3 | 22210022221120101 |
4 | 13201020320011 |
5 | 224242040441 |
6 | 20303204101 |
7 | 3061032004 |
oct | 741107005 |
9 | 283287511 |
10 | 126127621 |
11 | 65217604 |
12 | 362a6631 |
13 | 20191039 |
14 | 12a72c3b |
15 | b116231 |
hex | 7848e05 |
126127621 has 2 divisors, whose sum is σ = 126127622. Its totient is φ = 126127620.
The previous prime is 126127613. The next prime is 126127657. The reversal of 126127621 is 126721621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114190596 + 11937025 = 10686^2 + 3455^2 .
It is a cyclic number.
It is not a de Polignac number, because 126127621 - 23 = 126127613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 126127621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126127691) 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 as a sum of consecutive naturals, namely, 63063810 + 63063811.
It is an arithmetic number, because the mean of its divisors is an integer number (63063811).
Almost surely, 2126127621 is an apocalyptic number.
It is an amenable number.
126127621 is a deficient number, since it is larger than the sum of its proper divisors (1).
126127621 is an equidigital number, since it uses as much as digits as its factorization.
126127621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2016, while the sum is 28.
The square root of 126127621 is about 11230.6554127531. The cubic root of 126127621 is about 501.4989961965.
It can be divided in two parts, 1261 and 27621, that added together give a palindrome (28882).
The spelling of 126127621 in words is "one hundred twenty-six million, one hundred twenty-seven thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •