Base | Representation |
---|---|
bin | 1101010101001… |
… | …0001001100111 |
3 | 10220012120111100 |
4 | 3111102021213 |
5 | 103303123030 |
6 | 5314211143 |
7 | 1246143606 |
oct | 325221147 |
9 | 126176440 |
10 | 55911015 |
11 | 29618856 |
12 | 16883ab3 |
13 | b777a54 |
14 | 75d5a3d |
15 | 4d96360 |
hex | 3552267 |
55911015 has 24 divisors (see below), whose sum is σ = 102014640. Its totient is φ = 28249344.
The previous prime is 55911001. The next prime is 55911061. The reversal of 55911015 is 51011955.
55911015 is a `hidden beast` number, since 559 + 1 + 101 + 5 = 666.
55911015 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55911015 - 25 = 55910983 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55911015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31842 + ... + 33551.
It is an arithmetic number, because the mean of its divisors is an integer number (4250610).
Almost surely, 255911015 is an apocalyptic number.
55911015 is a deficient number, since it is larger than the sum of its proper divisors (46103625).
55911015 is a wasteful number, since it uses less digits than its factorization.
55911015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65423 (or 65420 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 27.
The square root of 55911015 is about 7477.3668493662. The cubic root of 55911015 is about 382.3834836699.
The spelling of 55911015 in words is "fifty-five million, nine hundred eleven thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •