Base | Representation |
---|---|
bin | 11011110000111101110111… |
… | …10000000011111100011101 |
3 | 22000011220111021202212111001 |
4 | 31320132323300003330131 |
5 | 31000320403133113401 |
6 | 333504442330030301 |
7 | 15601105216312324 |
oct | 1570367360037435 |
9 | 260156437685431 |
10 | 61056110051101 |
11 | 184aa829437960 |
12 | 6a210bb878391 |
13 | 280b7497051a9 |
14 | 11111bab690bb |
15 | 70d3222d4601 |
hex | 3787bbc03f1d |
61056110051101 has 4 divisors (see below), whose sum is σ = 66606665510304. Its totient is φ = 55505554591900.
The previous prime is 61056110051099. The next prime is 61056110051143. The reversal of 61056110051101 is 10115001165016.
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 61056110051101 - 21 = 61056110051099 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 61056110051101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61056110051191) 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, 2775277729585 + ... + 2775277729606.
It is an arithmetic number, because the mean of its divisors is an integer number (16651666377576).
Almost surely, 261056110051101 is an apocalyptic number.
It is an amenable number.
61056110051101 is a deficient number, since it is larger than the sum of its proper divisors (5550555459203).
61056110051101 is a wasteful number, since it uses less digits than its factorization.
61056110051101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5550555459202.
The product of its (nonzero) digits is 900, while the sum is 28.
The spelling of 61056110051101 in words is "sixty-one trillion, fifty-six billion, one hundred ten million, fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •