Base | Representation |
---|---|
bin | 110010111000010001… |
… | …101111101000011101 |
3 | 12020000100100220101112 |
4 | 302320101233220131 |
5 | 1343341101014340 |
6 | 41033001351405 |
7 | 3642546051311 |
oct | 627021575035 |
9 | 166010326345 |
10 | 54631266845 |
11 | 21194a20411 |
12 | a707a98565 |
13 | 51c83b67cc |
14 | 2903849b41 |
15 | 164b262065 |
hex | cb846fa1d |
54631266845 has 4 divisors (see below), whose sum is σ = 65557520220. Its totient is φ = 43705013472.
The previous prime is 54631266841. The next prime is 54631266863. The reversal of 54631266845 is 54866213645.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29796973924 + 24834292921 = 172618^2 + 157589^2 .
It is a cyclic number.
It is not a de Polignac number, because 54631266845 - 22 = 54631266841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54631266793 and 54631266802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54631266841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5463126680 + ... + 5463126689.
It is an arithmetic number, because the mean of its divisors is an integer number (16389380055).
Almost surely, 254631266845 is an apocalyptic number.
It is an amenable number.
54631266845 is a deficient number, since it is larger than the sum of its proper divisors (10926253375).
54631266845 is a wasteful number, since it uses less digits than its factorization.
54631266845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10926253374.
The product of its digits is 4147200, while the sum is 50.
The spelling of 54631266845 in words is "fifty-four billion, six hundred thirty-one million, two hundred sixty-six thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •