Base | Representation |
---|---|
bin | 110011001110010110… |
… | …001000001010001101 |
3 | 12020222011001102212201 |
4 | 303032112020022031 |
5 | 1400120341432022 |
6 | 41133425201501 |
7 | 3654663106036 |
oct | 631626101215 |
9 | 166864042781 |
10 | 55001514637 |
11 | 21364a15023 |
12 | a7aba90291 |
13 | 525700bb44 |
14 | 293aaa7a8d |
15 | 166d9ea127 |
hex | cce58828d |
55001514637 has 8 divisors (see below), whose sum is σ = 58285878840. Its totient is φ = 51809667840.
The previous prime is 55001514619. The next prime is 55001514641. The reversal of 55001514637 is 73641510055.
It can be written as a sum of positive squares in 4 ways, for example, as 1074921796 + 53926592841 = 32786^2 + 232221^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55001514637 - 223 = 54993126029 is a prime.
It is a super-2 number, since 2×550015146372 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55001514596 and 55001514605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55001514647) 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, 23128128 + ... + 23130505.
It is an arithmetic number, because the mean of its divisors is an integer number (7285734855).
Almost surely, 255001514637 is an apocalyptic number.
It is an amenable number.
55001514637 is a deficient number, since it is larger than the sum of its proper divisors (3284364203).
55001514637 is a wasteful number, since it uses less digits than its factorization.
55001514637 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46258703.
The product of its (nonzero) digits is 63000, while the sum is 37.
The spelling of 55001514637 in words is "fifty-five billion, one million, five hundred fourteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •