Base | Representation |
---|---|
bin | 101000011010101000110… |
… | …0001110111000111100101 |
3 | 201200000210210221201222110 |
4 | 1100311101201313013211 |
5 | 1212002122144412431 |
6 | 15451453300151233 |
7 | 1112214100405452 |
oct | 120652141670745 |
9 | 21600723851873 |
10 | 5554760544741 |
11 | 1851840573801 |
12 | 758672098519 |
13 | 313a72320725 |
14 | 152bcd668829 |
15 | 9975ab01346 |
hex | 50d518771e5 |
5554760544741 has 4 divisors (see below), whose sum is σ = 7406347392992. Its totient is φ = 3703173696492.
The previous prime is 5554760544737. The next prime is 5554760544761. The reversal of 5554760544741 is 1474450674555.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5554760544741 - 22 = 5554760544737 is a prime.
It is a super-2 number, since 2×55547605447412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5554760544701) 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, 925793424121 + ... + 925793424126.
It is an arithmetic number, because the mean of its divisors is an integer number (1851586848248).
Almost surely, 25554760544741 is an apocalyptic number.
It is an amenable number.
5554760544741 is a deficient number, since it is larger than the sum of its proper divisors (1851586848251).
5554760544741 is a wasteful number, since it uses less digits than its factorization.
5554760544741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851586848250.
The product of its (nonzero) digits is 47040000, while the sum is 57.
The spelling of 5554760544741 in words is "five trillion, five hundred fifty-four billion, seven hundred sixty million, five hundred forty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •