Base | Representation |
---|---|
bin | 100111100110000000010… |
… | …0000101101011011110001 |
3 | 201021020001200001210120001 |
4 | 1033030000200231123301 |
5 | 1203124131411414422 |
6 | 15323521445150001 |
7 | 1101103123663126 |
oct | 117140040553361 |
9 | 21236050053501 |
10 | 5441732138737 |
11 | 1808909a21414 |
12 | 73a7890bb301 |
13 | 3061cb5a4a0b |
14 | 14b54a1a674d |
15 | 96842c03227 |
hex | 4f30082d6f1 |
5441732138737 has 2 divisors, whose sum is σ = 5441732138738. Its totient is φ = 5441732138736.
The previous prime is 5441732138723. The next prime is 5441732138743. The reversal of 5441732138737 is 7378312371445.
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., 3415994794081 + 2025737344656 = 1848241^2 + 1423284^2 .
It is a cyclic number.
It is not a de Polignac number, because 5441732138737 - 215 = 5441732105969 is a prime.
It is a super-2 number, since 2×54417321387372 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5441732138537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2720866069368 + 2720866069369.
It is an arithmetic number, because the mean of its divisors is an integer number (2720866069369).
Almost surely, 25441732138737 is an apocalyptic number.
It is an amenable number.
5441732138737 is a deficient number, since it is larger than the sum of its proper divisors (1).
5441732138737 is an equidigital number, since it uses as much as digits as its factorization.
5441732138737 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11854080, while the sum is 55.
The spelling of 5441732138737 in words is "five trillion, four hundred forty-one billion, seven hundred thirty-two million, one hundred thirty-eight thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •