Base | Representation |
---|---|
bin | 101000010110001101000… |
… | …0011111101010010010101 |
3 | 201122010020022102012001001 |
4 | 1100230122003331102111 |
5 | 1211323122421233323 |
6 | 15443240442303301 |
7 | 1111426134333031 |
oct | 120543203752225 |
9 | 21563208365031 |
10 | 5545240024213 |
11 | 18487a547a81a |
12 | 7568557b7b31 |
13 | 312bb5a82026 |
14 | 1525690791c1 |
15 | 9939eda63ad |
hex | 50b1a0fd495 |
5545240024213 has 2 divisors, whose sum is σ = 5545240024214. Its totient is φ = 5545240024212.
The previous prime is 5545240024199. The next prime is 5545240024253. The reversal of 5545240024213 is 3124200425455.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5444932899844 + 100307124369 = 2333438^2 + 316713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5545240024213 is a prime.
It is a super-2 number, since 2×55452400242132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5545240024253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2772620012106 + 2772620012107.
It is an arithmetic number, because the mean of its divisors is an integer number (2772620012107).
Almost surely, 25545240024213 is an apocalyptic number.
It is an amenable number.
5545240024213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5545240024213 is an equidigital number, since it uses as much as digits as its factorization.
5545240024213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192000, while the sum is 37.
Adding to 5545240024213 its reverse (3124200425455), we get a palindrome (8669440449668).
The spelling of 5545240024213 in words is "five trillion, five hundred forty-five billion, two hundred forty million, twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •