Base | Representation |
---|---|
bin | 111010101100110011… |
… | …0000111010111100101 |
3 | 110001101010220001000211 |
4 | 1311121212013113211 |
5 | 4031131121343321 |
6 | 133524311335421 |
7 | 12051546436462 |
oct | 1653146072745 |
9 | 401333801024 |
10 | 126057215461 |
11 | 49508014811 |
12 | 20520381571 |
13 | bb6c096828 |
14 | 615b9aa669 |
15 | 342bb410e1 |
hex | 1d599875e5 |
126057215461 has 2 divisors, whose sum is σ = 126057215462. Its totient is φ = 126057215460.
The previous prime is 126057215447. The next prime is 126057215467. The reversal of 126057215461 is 164512750621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99118558561 + 26938656900 = 314831^2 + 164130^2 .
It is an emirp because it is prime and its reverse (164512750621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126057215461 - 25 = 126057215429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126057215467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63028607730 + 63028607731.
It is an arithmetic number, because the mean of its divisors is an integer number (63028607731).
Almost surely, 2126057215461 is an apocalyptic number.
It is an amenable number.
126057215461 is a deficient number, since it is larger than the sum of its proper divisors (1).
126057215461 is an equidigital number, since it uses as much as digits as its factorization.
126057215461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 40.
The spelling of 126057215461 in words is "one hundred twenty-six billion, fifty-seven million, two hundred fifteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •