Base | Representation |
---|---|
bin | 110011010100011010… |
… | …000101100000110001 |
3 | 12021020020102101110110 |
4 | 303110122011200301 |
5 | 1400322410400130 |
6 | 41151501051533 |
7 | 3660336414351 |
oct | 632432054061 |
9 | 167206371413 |
10 | 55103215665 |
11 | 21407368563 |
12 | a819b56ba9 |
13 | 52720c9974 |
14 | 294a3bcb61 |
15 | 16778d8ab0 |
hex | cd4685831 |
55103215665 has 24 divisors (see below), whose sum is σ = 91310177088. Its totient is φ = 28374982720.
The previous prime is 55103215597. The next prime is 55103215669. The reversal of 55103215665 is 56651230155.
It is not a de Polignac number, because 55103215665 - 220 = 55102167089 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (55103215669) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2171421 + ... + 2196650.
It is an arithmetic number, because the mean of its divisors is an integer number (3804590712).
Almost surely, 255103215665 is an apocalyptic number.
It is an amenable number.
55103215665 is a deficient number, since it is larger than the sum of its proper divisors (36206961423).
55103215665 is a wasteful number, since it uses less digits than its factorization.
55103215665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4368137 (or 4368108 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 55103215665 in words is "fifty-five billion, one hundred three million, two hundred fifteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •