Base | Representation |
---|---|
bin | 101000000001001011111… |
… | …011101010001101000000 |
3 | 100201220100220220002122211 |
4 | 220001023323222031000 |
5 | 330024102032000000 |
6 | 5503205031511504 |
7 | 402453606545215 |
oct | 50011373521500 |
9 | 10656326802584 |
10 | 2750053000000 |
11 | 970322252189 |
12 | 384b8b228594 |
13 | 16c437739a77 |
14 | 9716355db0c |
15 | 4b8063e87ba |
hex | 2804beea340 |
2750053000000 has 98 divisors (see below), whose sum is σ = 6821335693598. Its totient is φ = 1100020800000.
The previous prime is 2750052999983. The next prime is 2750053000003. The reversal of 2750053000000 is 3500572.
It can be written as a sum of positive squares in 7 ways, for example, as 2444544758016 + 305508241984 = 1563504^2 + 552728^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2750053000003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 375027 + ... + 2375026.
Almost surely, 22750053000000 is an apocalyptic number.
2750053000000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2750053000000 is an abundant number, since it is smaller than the sum of its proper divisors (4071282693598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2750053000000 is an frugal number, since it uses more digits than its factorization.
2750053000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2750095 (or 2750060 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 22.
Adding to 2750053000000 its reverse (3500572), we get a palindrome (2750056500572).
The spelling of 2750053000000 in words is "two trillion, seven hundred fifty billion, fifty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •