Base | Representation |
---|---|
bin | 110011111101100111… |
… | …001010001011111101 |
3 | 12100000102012201000022 |
4 | 303331213022023331 |
5 | 1403231343233131 |
6 | 41344233541525 |
7 | 4013432332442 |
oct | 637547121375 |
9 | 170012181008 |
10 | 55794508541 |
11 | 21731600092 |
12 | a9915748a5 |
13 | 53523aaac5 |
14 | 29b412b9c9 |
15 | 16b843b37b |
hex | cfd9ca2fd |
55794508541 has 4 divisors (see below), whose sum is σ = 56981625792. Its totient is φ = 54607391292.
The previous prime is 55794508519. The next prime is 55794508621. The reversal of 55794508541 is 14580549755.
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 a cyclic number.
It is not a de Polignac number, because 55794508541 - 26 = 55794508477 is a prime.
It is a super-2 number, since 2×557945085412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55794508741) 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 in 3 ways as a sum of consecutive naturals, for example, 593558555 + ... + 593558648.
It is an arithmetic number, because the mean of its divisors is an integer number (14245406448).
Almost surely, 255794508541 is an apocalyptic number.
It is an amenable number.
55794508541 is a deficient number, since it is larger than the sum of its proper divisors (1187117251).
55794508541 is a wasteful number, since it uses less digits than its factorization.
55794508541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1187117250.
The product of its (nonzero) digits is 5040000, while the sum is 53.
The spelling of 55794508541 in words is "fifty-five billion, seven hundred ninety-four million, five hundred eight thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •