Base | Representation |
---|---|
bin | 110010111001011111… |
… | …011011010000110001 |
3 | 12020001202200111021012 |
4 | 302321133123100301 |
5 | 1343411304140031 |
6 | 41035010040305 |
7 | 3643214124056 |
oct | 627137332061 |
9 | 166052614235 |
10 | 54651630641 |
11 | 211a5469aa3 |
12 | a712879095 |
13 | 51cc6966aa |
14 | 290642b02d |
15 | 164ce35b2b |
hex | cb97db431 |
54651630641 has 8 divisors (see below), whose sum is σ = 56134705704. Its totient is φ = 53175703680.
The previous prime is 54651630629. The next prime is 54651630701. The reversal of 54651630641 is 14603615645.
It can be written as a sum of positive squares in 4 ways, for example, as 10635590641 + 44016040000 = 103129^2 + 209800^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54651630641 is a prime.
It is a super-4 number, since 4×546516306414 (a number of 44 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (54651630611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1771526 + ... + 1802111.
It is an arithmetic number, because the mean of its divisors is an integer number (7016838213).
Almost surely, 254651630641 is an apocalyptic number.
It is an amenable number.
54651630641 is a deficient number, since it is larger than the sum of its proper divisors (1483075063).
54651630641 is a wasteful number, since it uses less digits than its factorization.
54651630641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3574051.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 54651630641 in words is "fifty-four billion, six hundred fifty-one million, six hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •