Base | Representation |
---|---|
bin | 11001001100111110011110… |
… | …11101000011101100001101 |
3 | 21021020020102200121111202012 |
4 | 30212133033131003230031 |
5 | 24231011104020140133 |
6 | 313512132031111005 |
7 | 14450032015126133 |
oct | 1446371735035415 |
9 | 237206380544665 |
10 | 55421443521293 |
11 | 16728114040973 |
12 | 6271069372465 |
13 | 24c02b18a91c5 |
14 | d985ab039753 |
15 | 66198b5d5b48 |
hex | 3267cf743b0d |
55421443521293 has 2 divisors, whose sum is σ = 55421443521294. Its totient is φ = 55421443521292.
The previous prime is 55421443521251. The next prime is 55421443521343. The reversal of 55421443521293 is 39212534412455.
It is a happy number.
It is an a-pointer prime, because the next prime (55421443521343) can be obtained adding 55421443521293 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33052346279689 + 22369097241604 = 5749117^2 + 4729598^2 .
It is a cyclic number.
It is not a de Polignac number, because 55421443521293 - 224 = 55421426744077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55421443521203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27710721760646 + 27710721760647.
It is an arithmetic number, because the mean of its divisors is an integer number (27710721760647).
Almost surely, 255421443521293 is an apocalyptic number.
It is an amenable number.
55421443521293 is a deficient number, since it is larger than the sum of its proper divisors (1).
55421443521293 is an equidigital number, since it uses as much as digits as its factorization.
55421443521293 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5184000, while the sum is 50.
The spelling of 55421443521293 in words is "fifty-five trillion, four hundred twenty-one billion, four hundred forty-three million, five hundred twenty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •