Base | Representation |
---|---|
bin | 100111100111001111110… |
… | …1011100010000100001101 |
3 | 201021110221202220220101202 |
4 | 1033032133223202010031 |
5 | 1203200114023144401 |
6 | 15325042441315245 |
7 | 1101226241064551 |
oct | 117163753420415 |
9 | 21243852826352 |
10 | 5444402553101 |
11 | 1809a5a340236 |
12 | 73b1b3495b25 |
13 | 3065358ccc65 |
14 | 14b720ad7861 |
15 | 9694c39206b |
hex | 4f39fae210d |
5444402553101 has 2 divisors, whose sum is σ = 5444402553102. Its totient is φ = 5444402553100.
The previous prime is 5444402553041. The next prime is 5444402553157. The reversal of 5444402553101 is 1013552044445.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4157822777476 + 1286579775625 = 2039074^2 + 1134275^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5444402553101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5444402453101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2722201276550 + 2722201276551.
It is an arithmetic number, because the mean of its divisors is an integer number (2722201276551).
Almost surely, 25444402553101 is an apocalyptic number.
It is an amenable number.
5444402553101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5444402553101 is an equidigital number, since it uses as much as digits as its factorization.
5444402553101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 5444402553101 its reverse (1013552044445), we get a palindrome (6457954597546).
The spelling of 5444402553101 in words is "five trillion, four hundred forty-four billion, four hundred two million, five hundred fifty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •