Base | Representation |
---|---|
bin | 110010111011111110… |
… | …001001101101011101 |
3 | 12020011122222110002102 |
4 | 302323332021231131 |
5 | 1344002432132040 |
6 | 41043053534445 |
7 | 3644230603112 |
oct | 627376115535 |
9 | 166148873072 |
10 | 54693239645 |
11 | 212169a9500 |
12 | a7247a4425 |
13 | 52081a46c5 |
14 | 290bb7c909 |
15 | 1651904515 |
hex | cbbf89b5d |
54693239645 has 12 divisors (see below), whose sum is σ = 72140835900. Its totient is φ = 39776901120.
The previous prime is 54693239641. The next prime is 54693239683.
It is a happy number.
54693239645 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 21000067396 + 33693172249 = 144914^2 + 183557^2 .
It is not a de Polignac number, because 54693239645 - 22 = 54693239641 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54693239641) 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 11 ways as a sum of consecutive naturals, for example, 45200420 + ... + 45201629.
It is an arithmetic number, because the mean of its divisors is an integer number (6011736325).
Almost surely, 254693239645 is an apocalyptic number.
54693239645 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
54693239645 is a deficient number, since it is larger than the sum of its proper divisors (17447596255).
54693239645 is a wasteful number, since it uses less digits than its factorization.
54693239645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90402076 (or 90402065 counting only the distinct ones).
The product of its digits is 20995200, while the sum is 56.
The spelling of 54693239645 in words is "fifty-four billion, six hundred ninety-three million, two hundred thirty-nine thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •