Base | Representation |
---|---|
bin | 1101001010001000000… |
… | …00010001010001011001 |
3 | 1121012222111102000200221 |
4 | 12211010000101101121 |
5 | 24401411244100023 |
6 | 543410403400041 |
7 | 44443524510331 |
oct | 6450400212131 |
9 | 1535874360627 |
10 | 452112487513 |
11 | 1648157925a5 |
12 | 73757683021 |
13 | 33831c4ba7b |
14 | 17c4d2b00c1 |
15 | bb6197085d |
hex | 6944011459 |
452112487513 has 2 divisors, whose sum is σ = 452112487514. Its totient is φ = 452112487512.
The previous prime is 452112487471. The next prime is 452112487543. The reversal of 452112487513 is 315784211254.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 296053515664 + 156058971849 = 544108^2 + 395043^2 .
It is a cyclic number.
It is not a de Polignac number, because 452112487513 - 213 = 452112479321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 452112487513.
It is not a weakly prime, because it can be changed into another prime (452112487543) 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 as a sum of consecutive naturals, namely, 226056243756 + 226056243757.
It is an arithmetic number, because the mean of its divisors is an integer number (226056243757).
Almost surely, 2452112487513 is an apocalyptic number.
It is an amenable number.
452112487513 is a deficient number, since it is larger than the sum of its proper divisors (1).
452112487513 is an equidigital number, since it uses as much as digits as its factorization.
452112487513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 268800, while the sum is 43.
Adding to 452112487513 its reverse (315784211254), we get a palindrome (767896698767).
The spelling of 452112487513 in words is "four hundred fifty-two billion, one hundred twelve million, four hundred eighty-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •