Base | Representation |
---|---|
bin | 100111100101111111100… |
… | …1001010101000001111000 |
3 | 201021020000001222000202120 |
4 | 1033023333021111001320 |
5 | 1203124110030412443 |
6 | 15323515310201240 |
7 | 1101102425200302 |
oct | 117137711250170 |
9 | 21236001860676 |
10 | 5441709232248 |
11 | 18088a7aa6433 |
12 | 73a7814b3220 |
13 | 3061c6914693 |
14 | 14b547122972 |
15 | 96840bcb083 |
hex | 4f2ff255078 |
5441709232248 has 32 divisors (see below), whose sum is σ = 14195763216000. Its totient is φ = 1735037726048.
The previous prime is 5441709232181. The next prime is 5441709232301. The reversal of 5441709232248 is 8422329071445.
It is a super-2 number, since 2×54417092322482 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5441709232248.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 4929083898 + ... + 4929085001.
It is an arithmetic number, because the mean of its divisors is an integer number (443617600500).
Almost surely, 25441709232248 is an apocalyptic number.
It is an amenable number.
5441709232248 is an abundant number, since it is smaller than the sum of its proper divisors (8754053983752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5441709232248 is a wasteful number, since it uses less digits than its factorization.
5441709232248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9858168931 (or 9858168927 counting only the distinct ones).
The product of its (nonzero) digits is 3870720, while the sum is 51.
The spelling of 5441709232248 in words is "five trillion, four hundred forty-one billion, seven hundred nine million, two hundred thirty-two thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •