Base | Representation |
---|---|
bin | 11000101111100100110011… |
… | …00001001111100110110011 |
3 | 21010122122212120100012002111 |
4 | 30113302121201033212303 |
5 | 24112433140130200301 |
6 | 311420100415430151 |
7 | 14314036534203112 |
oct | 1427623141174663 |
9 | 233578776305074 |
10 | 54411221334451 |
11 | 1637873aa44783 |
12 | 6129313b25357 |
13 | 2448c5789b2c7 |
14 | d61735153c79 |
15 | 645562723551 |
hex | 317c9984f9b3 |
54411221334451 has 4 divisors (see below), whose sum is σ = 55303208569504. Its totient is φ = 53519234099400.
The previous prime is 54411221334433. The next prime is 54411221334493. The reversal of 54411221334451 is 15443312211445.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 54411221334451 - 245 = 19226849245619 is a prime.
It is a super-2 number, since 2×544112213344512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54411221334751) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 445993617435 + ... + 445993617556.
It is an arithmetic number, because the mean of its divisors is an integer number (13825802142376).
Almost surely, 254411221334451 is an apocalyptic number.
54411221334451 is a deficient number, since it is larger than the sum of its proper divisors (891987235053).
54411221334451 is an equidigital number, since it uses as much as digits as its factorization.
54411221334451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 891987235052.
The product of its digits is 230400, while the sum is 40.
Adding to 54411221334451 its reverse (15443312211445), we get a palindrome (69854533545896).
The spelling of 54411221334451 in words is "fifty-four trillion, four hundred eleven billion, two hundred twenty-one million, three hundred thirty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •