Base | Representation |
---|---|
bin | 101000000101110110011… |
… | …000111101001111000101 |
3 | 100202101021212222210220120 |
4 | 220011312120331033011 |
5 | 330114330413244001 |
6 | 5505353543252153 |
7 | 403021651035621 |
oct | 50056630751705 |
9 | 10671255883816 |
10 | 2755060290501 |
11 | 9724617896a2 |
12 | 385b4814a059 |
13 | 16ca54c4bb5c |
14 | 974ba59c181 |
15 | 4b9eace0236 |
hex | 2817663d3c5 |
2755060290501 has 4 divisors (see below), whose sum is σ = 3673413720672. Its totient is φ = 1836706860332.
The previous prime is 2755060290497. The next prime is 2755060290523. The reversal of 2755060290501 is 1050920605572.
2755060290501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2755060290501 - 22 = 2755060290497 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2755060290571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459176715081 + ... + 459176715086.
It is an arithmetic number, because the mean of its divisors is an integer number (918353430168).
Almost surely, 22755060290501 is an apocalyptic number.
It is an amenable number.
2755060290501 is a deficient number, since it is larger than the sum of its proper divisors (918353430171).
2755060290501 is an equidigital number, since it uses as much as digits as its factorization.
2755060290501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918353430170.
The product of its (nonzero) digits is 189000, while the sum is 42.
The spelling of 2755060290501 in words is "two trillion, seven hundred fifty-five billion, sixty million, two hundred ninety thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •