Base | Representation |
---|---|
bin | 1101010000101… |
… | …0001011100111 |
3 | 10212122121010102 |
4 | 3110022023213 |
5 | 103214204411 |
6 | 5304014315 |
7 | 1243505306 |
oct | 324121347 |
9 | 125577112 |
10 | 55616231 |
11 | 29437330 |
12 | 1676139b |
13 | b6a3818 |
14 | 755a43d |
15 | 4d38d3b |
hex | 350a2e7 |
55616231 has 32 divisors (see below), whose sum is σ = 68387328. Its totient is φ = 44605440.
The previous prime is 55616219. The next prime is 55616233. The reversal of 55616231 is 13261655.
55616231 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 55616231 - 210 = 55615207 is a prime.
It is a super-2 number, since 2×556162312 = 6186330301290722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55616194 and 55616203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55616233) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 288071 + ... + 288263.
It is an arithmetic number, because the mean of its divisors is an integer number (2137104).
Almost surely, 255616231 is an apocalyptic number.
55616231 is a deficient number, since it is larger than the sum of its proper divisors (12771097).
55616231 is a wasteful number, since it uses less digits than its factorization.
55616231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311.
The product of its digits is 5400, while the sum is 29.
The square root of 55616231 is about 7457.6290468218. The cubic root of 55616231 is about 381.7102757346.
Adding to 55616231 its reverse (13261655), we get a palindrome (68877886).
The spelling of 55616231 in words is "fifty-five million, six hundred sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •