Base | Representation |
---|---|
bin | 101100011101101101101… |
… | …010100110111111010111 |
3 | 101211002221100021201022012 |
4 | 230131231222212333113 |
5 | 400030242234240001 |
6 | 10255412230054435 |
7 | 433520444231354 |
oct | 54355552467727 |
9 | 11732840251265 |
10 | 3055561633751 |
11 | a7894697a560 |
12 | 4142314aa41b |
13 | 1921a48b3073 |
14 | a7c6612562b |
15 | 547374d02bb |
hex | 2c76daa6fd7 |
3055561633751 has 8 divisors (see below), whose sum is σ = 3363921066000. Its totient is φ = 2752299051840.
The previous prime is 3055561633739. The next prime is 3055561633757. The reversal of 3055561633751 is 1573361655503.
3055561633751 is digitally balanced in base 3, 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 3055561633751 - 230 = 3054487891927 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3055561633751.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3055561633757) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1274211326 + ... + 1274213723.
It is an arithmetic number, because the mean of its divisors is an integer number (420490133250).
Almost surely, 23055561633751 is an apocalyptic number.
3055561633751 is a deficient number, since it is larger than the sum of its proper divisors (308359432249).
3055561633751 is a wasteful number, since it uses less digits than its factorization.
3055561633751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2548425169.
The product of its (nonzero) digits is 4252500, while the sum is 50.
The spelling of 3055561633751 in words is "three trillion, fifty-five billion, five hundred sixty-one million, six hundred thirty-three thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •