Base | Representation |
---|---|
bin | 100110000000101011101… |
… | …0001011010010000010001 |
3 | 200111102102121101002222112 |
4 | 1030001113101122100101 |
5 | 1141043021432214323 |
6 | 15035534441115105 |
7 | 1046301111561641 |
oct | 114012721322021 |
9 | 20442377332875 |
10 | 5224144413713 |
11 | 1734602368085 |
12 | 704583488a95 |
13 | 2bb8335a3a74 |
14 | 140bc8336521 |
15 | 90d5a6b1178 |
hex | 4c05745a411 |
5224144413713 has 2 divisors, whose sum is σ = 5224144413714. Its totient is φ = 5224144413712.
The previous prime is 5224144413661. The next prime is 5224144413721. The reversal of 5224144413713 is 3173144414225.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5073094036609 + 151050377104 = 2252353^2 + 388652^2 .
It is a cyclic number.
It is not a de Polignac number, because 5224144413713 - 28 = 5224144413457 is a prime.
It is a super-3 number, since 3×52241444137133 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5224144413773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2612072206856 + 2612072206857.
It is an arithmetic number, because the mean of its divisors is an integer number (2612072206857).
Almost surely, 25224144413713 is an apocalyptic number.
It is an amenable number.
5224144413713 is a deficient number, since it is larger than the sum of its proper divisors (1).
5224144413713 is an equidigital number, since it uses as much as digits as its factorization.
5224144413713 is an evil number, because the sum of its binary digits is even.
The product of its digits is 322560, while the sum is 41.
Adding to 5224144413713 its reverse (3173144414225), we get a palindrome (8397288827938).
The spelling of 5224144413713 in words is "five trillion, two hundred twenty-four billion, one hundred forty-four million, four hundred thirteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •