Base | Representation |
---|---|
bin | 1101010110000… |
… | …0111100001101 |
3 | 10220022122121010 |
4 | 3111200330031 |
5 | 103312042342 |
6 | 5315355433 |
7 | 1246515333 |
oct | 325407415 |
9 | 126278533 |
10 | 55971597 |
11 | 2965a320 |
12 | 168b2b79 |
13 | b7994b6 |
14 | 760db53 |
15 | 4da929c |
hex | 3560f0d |
55971597 has 8 divisors (see below), whose sum is σ = 81413280. Its totient is φ = 33922160.
The previous prime is 55971583. The next prime is 55971611. The reversal of 55971597 is 79517955.
55971597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (55971583) and next prime (55971611).
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 55971597 - 27 = 55971469 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55971557) 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 7 ways as a sum of consecutive naturals, for example, 848022 + ... + 848087.
It is an arithmetic number, because the mean of its divisors is an integer number (10176660).
Almost surely, 255971597 is an apocalyptic number.
It is an amenable number.
55971597 is a deficient number, since it is larger than the sum of its proper divisors (25441683).
55971597 is a wasteful number, since it uses less digits than its factorization.
55971597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1696123.
The product of its digits is 496125, while the sum is 48.
The square root of 55971597 is about 7481.4167775897. The cubic root of 55971597 is about 382.5215434916.
The spelling of 55971597 in words is "fifty-five million, nine hundred seventy-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •