Base | Representation |
---|---|
bin | 11001000110101000010000… |
… | …11001111100111000110111 |
3 | 21020110101111202212002102201 |
4 | 30203110020121330320313 |
5 | 24213422433023114330 |
6 | 313224023235445331 |
7 | 14425211421050665 |
oct | 1443241031747067 |
9 | 236411452762381 |
10 | 55203355676215 |
11 | 16653680148a7a |
12 | 6236944156847 |
13 | 24a58670b0626 |
14 | d8bbdc9c1c35 |
15 | 65ae75204eca |
hex | 32350867ce37 |
55203355676215 has 8 divisors (see below), whose sum is σ = 68528303598240. Its totient is φ = 42639833349792.
The previous prime is 55203355676143. The next prime is 55203355676243. The reversal of 55203355676215 is 51267655330255.
55203355676215 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 55203355676215 - 219 = 55203355151927 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, 190356398739 + ... + 190356399028.
It is an arithmetic number, because the mean of its divisors is an integer number (8566037949780).
Almost surely, 255203355676215 is an apocalyptic number.
55203355676215 is a deficient number, since it is larger than the sum of its proper divisors (13324947922025).
55203355676215 is a wasteful number, since it uses less digits than its factorization.
55203355676215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380712797801.
The product of its (nonzero) digits is 28350000, while the sum is 55.
The spelling of 55203355676215 in words is "fifty-five trillion, two hundred three billion, three hundred fifty-five million, six hundred seventy-six thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •