Base | Representation |
---|---|
bin | 111001010011111010000001… |
… | …111001101101000100101101 |
3 | 1020001110101012221012101010221 |
4 | 321103322001321231010231 |
5 | 231014143434302330444 |
6 | 2252025114535531341 |
7 | 104043330160444606 |
oct | 7123720171550455 |
9 | 1201411187171127 |
10 | 252056630120749 |
11 | 73349686667103 |
12 | 2432a31b529b51 |
13 | aa84ab87954bc |
14 | 463586aba4dad |
15 | 1e21888676a84 |
hex | e53e81e6d12d |
252056630120749 has 2 divisors, whose sum is σ = 252056630120750. Its totient is φ = 252056630120748.
The previous prime is 252056630120723. The next prime is 252056630120783. The reversal of 252056630120749 is 947021036650252.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157928408239849 + 94128221880900 = 12566957^2 + 9701970^2 .
It is a cyclic number.
It is not a de Polignac number, because 252056630120749 - 217 = 252056629989677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 252056630120696 and 252056630120705.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (252056630120849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126028315060374 + 126028315060375.
It is an arithmetic number, because the mean of its divisors is an integer number (126028315060375).
Almost surely, 2252056630120749 is an apocalyptic number.
It is an amenable number.
252056630120749 is a deficient number, since it is larger than the sum of its proper divisors (1).
252056630120749 is an equidigital number, since it uses as much as digits as its factorization.
252056630120749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5443200, while the sum is 52.
The spelling of 252056630120749 in words is "two hundred fifty-two trillion, fifty-six billion, six hundred thirty million, one hundred twenty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •