Base | Representation |
---|---|
bin | 100111100101101011000… |
… | …0110100111011000110001 |
3 | 201021011020002021200120012 |
4 | 1033023112012213120301 |
5 | 1203121202241431103 |
6 | 15323323111424305 |
7 | 1101046364323016 |
oct | 117132606473061 |
9 | 21234202250505 |
10 | 5441020655153 |
11 | 1808584349256 |
12 | 73a60a985095 |
13 | 306117074705 |
14 | 14b4bd8bd70d |
15 | 968005132d8 |
hex | 4f2d61a7631 |
5441020655153 has 2 divisors, whose sum is σ = 5441020655154. Its totient is φ = 5441020655152.
The previous prime is 5441020655089. The next prime is 5441020655159. The reversal of 5441020655153 is 3515560201445.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5425810859569 + 15209795584 = 2329337^2 + 123328^2 .
It is a cyclic number.
It is not a de Polignac number, because 5441020655153 - 26 = 5441020655089 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5441020655153.
It is not a weakly prime, because it can be changed into another prime (5441020655159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2720510327576 + 2720510327577.
It is an arithmetic number, because the mean of its divisors is an integer number (2720510327577).
Almost surely, 25441020655153 is an apocalyptic number.
It is an amenable number.
5441020655153 is a deficient number, since it is larger than the sum of its proper divisors (1).
5441020655153 is an equidigital number, since it uses as much as digits as its factorization.
5441020655153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360000, while the sum is 41.
Adding to 5441020655153 its reverse (3515560201445), we get a palindrome (8956580856598).
The spelling of 5441020655153 in words is "five trillion, four hundred forty-one billion, twenty million, six hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •