Base | Representation |
---|---|
bin | 110011010000001100… |
… | …000111100100011111 |
3 | 12021001022020212122200 |
4 | 303100030013210133 |
5 | 1400201301221330 |
6 | 41140452142543 |
7 | 3655520031456 |
oct | 632014074437 |
9 | 167038225580 |
10 | 55032445215 |
11 | 21380420690 |
12 | a7ba307a53 |
13 | 526054b567 |
14 | 2940c39b9d |
15 | 16715a9a60 |
hex | cd030791f |
55032445215 has 48 divisors (see below), whose sum is σ = 109538282880. Its totient is φ = 25278056640.
The previous prime is 55032445211. The next prime is 55032445229. The reversal of 55032445215 is 51254423055.
55032445215 is a `hidden beast` number, since 550 + 3 + 2 + 44 + 52 + 15 = 666.
It is not a de Polignac number, because 55032445215 - 22 = 55032445211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55032445215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55032445211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2916297 + ... + 2935106.
It is an arithmetic number, because the mean of its divisors is an integer number (2282047560).
Almost surely, 255032445215 is an apocalyptic number.
55032445215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55032445215 is a deficient number, since it is larger than the sum of its proper divisors (54505837665).
55032445215 is a wasteful number, since it uses less digits than its factorization.
55032445215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5851444 (or 5851441 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
The spelling of 55032445215 in words is "fifty-five billion, thirty-two million, four hundred forty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •