Base | Representation |
---|---|
bin | 11001010001010111101001… |
… | …10101110100001011000101 |
3 | 21021202200001201202000211021 |
4 | 30220223310311310023011 |
5 | 24240444231010424220 |
6 | 314105334453111141 |
7 | 14463654513254512 |
oct | 1450536465641305 |
9 | 237680051660737 |
10 | 55572394623685 |
11 | 16786135aa5355 |
12 | 62963766284b1 |
13 | 25015ba205134 |
14 | da1a0ac4a309 |
15 | 6658739384aa |
hex | 328af4d742c5 |
55572394623685 has 8 divisors (see below), whose sum is σ = 69586302833280. Its totient is φ = 42524962842384.
The previous prime is 55572394623677. The next prime is 55572394623763. The reversal of 55572394623685 is 58632649327555.
55572394623685 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 55572394623685 - 23 = 55572394623677 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241619106945 + ... + 241619107174.
It is an arithmetic number, because the mean of its divisors is an integer number (8698287854160).
Almost surely, 255572394623685 is an apocalyptic number.
It is an amenable number.
55572394623685 is a deficient number, since it is larger than the sum of its proper divisors (14013908209595).
55572394623685 is a wasteful number, since it uses less digits than its factorization.
55572394623685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483238214147.
The product of its digits is 1632960000, while the sum is 70.
The spelling of 55572394623685 in words is "fifty-five trillion, five hundred seventy-two billion, three hundred ninety-four million, six hundred twenty-three thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •