Base | Representation |
---|---|
bin | 11100101010001110001011… |
… | …100111100100001100101101 |
3 | 121112021221200120020210010202 |
4 | 130222032023213210030231 |
5 | 113010122214343444441 |
6 | 1124025024304043245 |
7 | 35356401624115643 |
oct | 3452161347441455 |
9 | 545257616223122 |
10 | 126046747640621 |
11 | 371871420139a5 |
12 | 12178854903525 |
13 | 5544207787682 |
14 | 231a9a3655193 |
15 | e88b7269119b |
hex | 72a38b9e432d |
126046747640621 has 2 divisors, whose sum is σ = 126046747640622. Its totient is φ = 126046747640620.
The previous prime is 126046747640551. The next prime is 126046747640623.
126046747640621 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123369580838596 + 2677166802025 = 11107186^2 + 1636205^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 126046747640621 - 226 = 126046680531757 is a prime.
Together with 126046747640623, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126046747640623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63023373820310 + 63023373820311.
It is an arithmetic number, because the mean of its divisors is an integer number (63023373820311).
Almost surely, 2126046747640621 is an apocalyptic number.
It is an amenable number.
126046747640621 is a deficient number, since it is larger than the sum of its proper divisors (1).
126046747640621 is an equidigital number, since it uses as much as digits as its factorization.
126046747640621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16257024, while the sum is 56.
The spelling of 126046747640621 in words is "one hundred twenty-six trillion, forty-six billion, seven hundred forty-seven million, six hundred forty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •