Base | Representation |
---|---|
bin | 101000000010001101111… |
… | …101011000010010000000 |
3 | 100202000020010022111001112 |
4 | 220002031331120102000 |
5 | 330033334122402021 |
6 | 5503511002422452 |
7 | 402523220335544 |
oct | 50021575302200 |
9 | 10660203274045 |
10 | 2751160747136 |
11 | 970840578a8a |
12 | 38523a201a28 |
13 | 16c5830a0a49 |
14 | 9722a717a24 |
15 | 4b86d7aed5b |
hex | 2808df58480 |
2751160747136 has 64 divisors (see below), whose sum is σ = 5551373011200. Its totient is φ = 1357882306560.
The previous prime is 2751160747133. The next prime is 2751160747163. The reversal of 2751160747136 is 6317470611572.
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (2751160747133) 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, 52890101 + ... + 52942091.
It is an arithmetic number, because the mean of its divisors is an integer number (86740203300).
Almost surely, 22751160747136 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2751160747136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2775686505600).
2751160747136 is an abundant number, since it is smaller than the sum of its proper divisors (2800212264064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2751160747136 is an equidigital number, since it uses as much as digits as its factorization.
2751160747136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57317 (or 57305 counting only the distinct ones).
The product of its (nonzero) digits is 1481760, while the sum is 50.
The spelling of 2751160747136 in words is "two trillion, seven hundred fifty-one billion, one hundred sixty million, seven hundred forty-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •